|
 |
|
|
|
|
[186] F. Stephan, Noisy inference and oracles, Algorithmic Learning Theory: Sixth International Workshop (ALT '95), Lecture Notes in Artificial Intelligence, vol. 997, Springer-Verlag, 1995, pp. 185-200. |
|
|
|
|
|
|
|
|
[187] P. Suppes, Philosophy and the sciences, Acting and reflecting (W. Sieg, ed.), Kluwer, 1990. |
|
|
|
|
|
|
|
|
[188] B. Trakhtenbrot and J. Barzdins
*, Konetschnyje awtomaty (powedenie i sintez), Nauka, Moskwa, 1970, in Russian. English Translation: Finite Automata-Behavior and Synthesis, Fundamental Studies in Computer Science 1, North Holland, Amsterdam, 1975. |
|
|
|
|
|
|
|
|
[189] H. van Riemskijk and E. Williams, Introduction to the theory of grammar, MIT Press, 1986. |
|
|
|
|
|
|
|
|
[190] T. Wasow, Grammatical theory, Foundations of Cognitive Science (Michael Posner, ed.), MIT Press, 1989. |
|
|
|
|
|
|
|
|
[191] J. Webb, Mechanism, mentalism, and metamathematics, D. Reidel, 1980. |
|
|
|
|
|
|
|
|
[192] K. Weihrauch, Computability, Springer-Verlag, 1987. |
|
|
|
|
|
|
|
|
[193] J. Werker, Exploring developmental changes in cross-language speech perception, Invitation to Cognitive Science: Language, 2nd Edition (L. Gleitman and M. Liberman, eds.), MIT Press, 1995. |
|
|
|
|
|
|
|
|
[194] K. Wexler and P. Culicover, Formal principles of language acquisition, MIT Press, 1980. |
|
|
|
|
|
|
|
|
[195] R. Wiehagen, Identification of formal languages, Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 53, Springer-Verlag, 1977, pp. 571-579. |
|
|
|
|
|
|
|
|
[196] ———, Characterization problems in the theory of inductive inference, Proceedings of the 5th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 62, Springer-Verlag, 1978, pp. 494-508. |
|
|
|
|
|
|
|
|
[197] ———, How fast is program synthesis from examples, Mathematical Methods of Specification and Synthesis of Software Systems (W. Bibel and K. Jantke, eds.), Lecture Notes in Computer Science, vol. 215, Springer-Verlag, 1985, pp. 231-239. |
|
|
|
|
|
|
|
|
[198] ———, On the complexity of effective program synthesis, Analogical and Inductive Inference, Proceedings of the International Workshop (K. Jantke, ed.), Lecture Notes in Computer Science, vol. 265, Springer-Verlag, 1986, pp. 209-219. |
|
|
|
|
|
|
|
|
[199] ———, On the complexity of program synthesis from examples, Electronische Informationverarbeitung und Kybernetik 22 (1986), 305-323. |
|
|
|
|
|
|
|
|
[200] ———, A thesis in inductive inference, Nonmonotonic and Inductive Logic, 1st International Workshop (J. Dix, K. Jantke, and P. Schmitt, eds.), Lecture Notes in Artificial Intelligence, vol. 543, Springer-Verlag, 1990, pp. 184-207. |
|
|
|
|
|
|
|
|
[201] R. Wiehagen, R. Freivalds, and E. Kinber, On the power of probabilistic strategies in inductive inference, Theoretical Computer Science 28 (1984), 111-133. |
|
|
|
|
