|
 |
|
|
|
|
[202] R. Wiehagen and W. Liepe, Charakteristische eigenschaften yon erkennbaren klassen rekursiver funktionen, Electronische Informationverarbeitung und Kybernetik 12 (1976), 421-438. |
|
|
|
|
|
|
|
|
[203] R. Wiehagen and T. Zeugmann, Ignoring data may be the only way to learn efficiently, Journal of Experimental and Theoretical Artificial Intelligence 6 (1994), 131-144. |
|
|
|
|
|
|
|
|
[204] K. Wright, Identification of unions of languages drawn from an identifiable class, Proceedings of the Second Annual Workshop on Computational Learning Theory (R. Rivest, D. Haussler, and M. Warmuth, eds.), Morgan Kaufmann, 1989, pp. 328-333. |
|
|
|
|
|
|
|
|
[205] T. Yokomori, On polynomial-time learning in the limit of strictly deterministic automata, Machine Learning 19 (1996), 153-182. |
|
|
|
|
|
|
|
|
[206] T. Zeugmann, A-posteriori characterizations in inductive inference of recursive functions, Electronische Informationverarbeitung und Kybernetik 19 (1983), 559-594. |
|
|
|
|
|
|
|
|
[207] ———, On the synthesis of fastest programs in inductive inference, Electronische Informationverarbeitung und Kybernetik 19 (1983), 625-642. |
|
|
|
|
|
|
|
|
[208] T. Zeugmann and S. Lange, A guided tour across the boundaries of learning recursive languages, Algorithmic Learning for Knowledge-Based Systems (K. Jantke and S. Lange, eds.), Lecture Notes in Artificial Intelligence, vol. 961, Springer-Verlag, 1995, pp. 190-258. |
|
|
|
|
|
|
|
|
[209] T. Zeugmann, S. Lange, and S. Kapur, Characterizations of monotonic and dual monotonic language learning, Information and Computation 120 (1995), 155-173. |
|
|
|
|
