Inductive Inference: Theory and Methods

ACM Computing Surveys (CSUR)

Volumn 15, Issue 3, 1983, Pages 237-269

  Angluin, Dana ^a   Smith, Carl H ^b  

^a YALE UNIVERSITY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Inductive inference; learning by example

Indexed keywords

SYSTEMS SCIENCE AND CYBERNETICS;

EID: 0020815483     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/356914.356918     Document Type: Article

References (153)

1. Adelman, L., and Blum, M. 197B. Inductive inference and unsolvability. Tech. Rep., Electrical Engineering and Computer Science Dept., Univ. of Calif., Berkeley.
2. Angluin, D. 1978. On the complexity of minimum inference of regular sets. Inf. Control 39, 337-350. Angluin, D. 1980a. Inductive inference of formal languages from positive data. Inf. Control 45, 117-135.
3. Angluin, D. 1980b. Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21, 46-62. Angluin, D. 1982a. A note on the number of queries needed to identify regular languages. Inf. Control 51, 76-87.
4. Angluin, D. 1982b. Inference of reversible languages. J. ACM 29, 3 (July), 741-765.
5. Babzdin, j. M. 1972. Prognostication of automata and functions. In Information Processing 71, B. Gilchrist, Ed. Elsevier North-Holland, New York, pp. 81-84.
6. BabzdiN, j. M. 1974a. On synthesizing programs given by examples. In Lecture Notes in Computer Science, vol. 5. Springer-Verlag, New York, pp. 53-63.
7. Barzdin, J, M. 1974b. Two theorems on the limiting synthesis of functions. Latv. Gos. Unw. Uch. Zap-iski 210, 82-SS (in Russian).
8. Barzdin, J, M., and Freivald, R. V. 1972. On the prediction of general recursive functions. Sov. Math. Dokl 13, 1224-1228.
9. Barzdin, J, M., and Podnieks, K. M. 1973. The theory of inductive inference (in Russian). In Proceedings of the 1st Conference on the Mathematical Foundations of Computer Science (High Tetras, Czechoslovakia). Math. Inst, of the Slovak Academy of Sciences, pp. 9-15.
10. Berger, J., and Pair, C. 1978. Inference for regular bilanguages. J. Comput. Sys. Set. 16, 100-122.
11. BiermaNN, a. W. 1972. On the inference of Turing machines from sample computations, Artif InteU. 3, 18H98.
12. Biermann, a. W. 197S. The inference of regular LISP programs from examples. IEEE Trans. Syst. Man Cybem. SMC-8, 585-600.
13. Biermann, A. W., and Feldman, J. A. 1972a. A survey of results in grammatical inference. In Frontiers of Pattern Recognition. Academic Press, New York.
14. Biermann, A, W., and Feldman, J. A. l72b. On the synthesis of finite-state machines from samples of their behavior. IEEE Trans. Comput. C-21, 592-597.
15. Biermann, A. W., and Krishnaswamv, R. 1976. Constructing programs from example computations. IEEE Trans. Softui. Eng. SE-2, 141-153.
16. Biermann, A. W., and Smith, D. R. 1977, The hierarchical synthesis of LISP scanning functions. In Information Processing 77, B- Gilchrist, Ed. Elsevier North-Holland, New York, pp. 41-45.
17. Biermann, A. W., Baum, R. L., and Petry, F. E. 1975. Speeding up the synthesis of programs from traces. IEEE Trans. Comput. C-24,122-136.
18. Blum, L., and Blum, M. 1975. Toward a mathematical theory of inductive inference. Inf. Control 2S, 125-155.
19. Blum, M. 1967a. On the size of machines. Inf. Control 11. 257-265.
20. Blum, M. 1967b. A machine-independent theory of the complexity of recursive functions. J. ACM 14, 2 (Ajjr.) 322-336.
21. Brandt, U. 1981. A characterization of identifiable sets. Preprint, Technische Hochschule Darmstadt, F.R.G.
22. Braver, J. M., and FU, K. S. 1977. A note on the k-tail method of tree grammar inference. IEEE Trans. Syst Man Cybern. SMC-7, 293-300.
23. Buchanan, B. G., and Feigenbaum, E. A. 1978. Dendral and Meta-Dendral: Their applications dimension. Artj. InteU. 11, 5-24.
24. Bundy, A., and Silver, B. 1981. A critical survey of rule learning programs. Tech. Rep. 169, Dept, of Artificial Intelligence, Edinburgh Univ.
25. Case, J., and Lynes, C. 1982. Inductive inference and language identification. In Proceedings of the International Colloquium on Algorithms, Languages, and Programming fICALP) 82, (Barcelona, Spain; June). Springer-Verlag, New York, pp. 107-115.
26. Case, J., and Ngo-Manguelle, S. 1979. Refinements of inductive inference by Popperian machines. Tech. Rep., Dept, of Computer Science, State Univ. of New York, Buffalo.
27. Case, J., and Smith, C. 1978. Anomaly hierarchies of mechanized inductive inference. In Proceedings of the 10th ACM Symposium on Theory of Computing (San Diego, Calif., May 1-3). ACM, New York, pp. 314-319.
28. Case, J., and Smith, C. 1983. Comparison of identification criteria for machine inductive inference. Theor. Comput. Sci. 25, 195-220.
29. Chaitin, G. j. 1974, Information-theoretic limitations of formal systems. J. ACM 21,3 (July), 403-424.
30. Chaitin, G. j. 1975. A theory of program size formally identical to information theory. J. ACM 22, 3 (July) 329-340.
31. Chaitin, G. J. 1976. Information-theoretic characterizations of recursive infinite strings. Theor. Comput. Sci 2, 45-48.
32. Chen, K. J. 1982. Tradeoffs in the inductive inference of nearly minimal size programs. Inf. Control 52, 68-86.
33. Cook, C. M., Rosenfeld, A., and Aronson, A. R. 1976. Grammatical inference by hill-climbing. Inf ScL 10, 59-80.
34. COULON, D., AND Kavser, D. 1979. Construction of natural language sentence acceptors by a supervised learning technique. IEEE Trans. Pattern Anal. Mack. InteU. PAMI-I, 94-99.
35. CreSpi-Reghizzi, s. 1972. An effective model for grammar inference. In Information Processing 71, B. Gilchrist, Ed. Elsevier North-Holland, New York, pp. 524-529.
36. CRESPI-ReGHIZZI, s., AND Mandrioli, D. 1980a. Abstract profiles for context-free languages. Tech. Rep. 80-6,1st. di Elettrotechnica ed Elet-tronica del Politechnico di Milano, Milan, Italy.
37. Crespi-Reghizzi, s., and Mandrioli, D. 1980b. Inferring grammars by means of profiles: a unifying view. Internal report, lat. di Elettrotechnica ed Elettronica del Politechnico di Milano, Milan, Italy.
38. Chespi-Reghizzi, s., Melkanoff. M., AND Lighten, L. 1973. The use of grammatical inference for designing programming languages. Commun. ACM 16, 2 (Feb.), 83-90.
39. Crespi-Reghizzi, S., Guida, G., and Mandrioli, D. 1978. Noncounting context-free languages. J. ACM 25, 4 (Oct.), 571-580.
40. Daley, R. 1973. An example of information and computation resource trade-off. J. ACM 20, 4 (Oct.), 687-695.
41. Daley, R. 1977. On the inference of optimal descriptions. Theor. Comput. Sci. 4, 301-319.
42. Daley, R. 1983. On the error correcting power of pluralism in inductive inference. Theor. Comput. ScL 24, 95-104.
43. Daley, R., and Smith, C. 1983. On the complexity of inductive inference. Tech. Rep. 83-4, Dept, of Computer Science, Univ. of Pittsburgh.
44. Dietterich, T. G., and Michalski, R. s. 1979. Learning and generaUzation of characteristic descriptions: Evaluation criteria and comparative review of selected methods. In Proceedings of the 6th International Joint Conference on AHifkial Intelligence (Tokyo, Aug.). International Joint Council on Artificial Intelligence, pp. 223-231.
45. Dietterich, T. G., London, R., Clarkson, K, and Dromev, R. 1982. Learning and inductive inference. In The Handbook of Artificial Intelligence, P. Cohen andE. Peigenbaum Eds. Kaufman, Los Altos, Calif., pp. 323-512.
46. Doucet, p. G. 1974. The syntactic inference problem for DOL sequences. In L-Systems, G. Rozen-berg and A. Salomaa, Eds. Springer Lecture Notes on Computer Science, vol. 15. Springer-Verlag, New York, pp. 146-161.
47. Feldman, J. A. 1967. First thoughts on gamniatical inference. Tech. Rep., Computer Science Dept., Artificial Intelligence Memo 55, Stanford University, Stanford, Calif.
48. Feldman, J. A. 1972. Some decidability results in grammatical inference. Inf. Control 20, 244-262.
49. Feldman, J. A., and Shields, P. 1977. Total complexity and the inference of best programs. Math. Sy…t. Theory. 10, 181-191.
50. Feldman, J. A., Gips, J., Horning, J. J., and Redbr, S. 1969. Grammatical complexity and inference. Tech. Rep., Computer Science Dept., Stanford Univ., Stanford, Calif.
51. Feliciangeli, H., and Herman, G. 1977. Algorithms for producing grammars from sample derivations: A common problem of formal language theory and developmental biology. J. Comput. Syst. ScL 7, 97-118.
52. Flanagan, P. A. 1981. A discrete model of semantic learning. Tech. Rep. CS-79, Computer Science Dept., Brown University, Providence, R. I.
53. Fkedkin, E. 1964. Techniques using LISP for automatically discovering interesting relations in data. In The Programming Language LISP, Berkey, Ed. M.I.T. Press, Cambridge, Mass., pp. 108-124.
54. Freivald, R. V. 1974. On the limit synthesis of numbers of general recursive functions in various computable numerations. Sou. Math. Dohl. 15, 1681-1683.
55. Freivald, R. V. 1975a. Minimal Godel numbers and their identification in the limit. In Lecture Notes in Computer Science,. Springer-Verlag, New York, pp. 219-225.
56. Freivald, R. V. 1975h. On the complexity and optimality of computation in the limit. Latv. Gos. Univ. Uch. Zapiski 233, 155-173 (in Russian).
57. Freivald, R. V. 1979. Finite identification of general recursive functions by probabilistic strategies. In Proceedings of the Conference on Algebraic, Arithmetic, and Categorial Methods in Computation Theory (Berlin, Sept.). L. Budach, Ed. Akademie-Verlag, Berlin, DDR putation Theory (Berlin, Sept. 1979). L. Budach, Ed. Akademie-Verlag, Berlin, DDR, pp. 138-145.
58. Freivald, R. V., and Wiehagen, R. 1979. Inductive inference with additional information. Electron. Informatiomverarb. Kybern. (EIK) IB, 179185.
59. Freivald, R. V., Kinber, E. B., and Wiehagen, R. 1982. Inductive inference and computable one-one numberings. Z. Logik Grundlag. Math. 23, 463-479.
60. Friedberg, R. 1958. Three theorems on recursive enumeration. J. Symb. Logic 23, 309-316.
61. Fu, K. S. 1975. Syntactic Methods in Pattern Recognition. Academic Press, New York.
62. Fu, K. S. 1977. Syntactic Pattern Recognition, Applications. Springer-Verlag, New York.
63. Fu, K. S. 1982. Syntactic Pattern Recognition and Applications. Prentice-Hall, New York.
64. Fu, K. S., AND Booth, T. L. 1975. Grammatical inference: introduction and survey, parts 1 and 2. IEEE Trans. Syst Man Cybern. SMC-5, 95-111, 409-423.
65. Gacs, p. 1983. On the relationship between descriptional complexity and algorithmic probability. Theor. Comput. ScL, 22, 1, 2, 71-93.
66. Gaines, B. R. 1976. Behavior/structure transformations under vincertainty. Int. J. Man-Mach. Stud. 8, 337-365.
67. Gaines, B. R. 1978. Maryanski's grammatical inferences IEEE Trans. Comput. C-28, 62-64.
68. Gold, E. M. 1967. Language identification in the limit. Inf Control 10. 447-474.
69. Gold, E. M. 1972. System identification via state characterization. Automatica 8, 621-636.
70. Gold, E. M. 1978. Complexity of automaton identification from given data. Inf Control. 37, 302-320.
71. Gonzalez, R. C., and Thomason, M. G. 1978. Syntactic Pattern Recognition, An Introduction. Addison-Wesley, Reading, Mass.
72. Gonzalez, R. C., Edwards, J. J., and Thomason, M. G. 1976. An algorithm for the inference of tree grammars. Int. J. Comput Inf. Sci. 5, 145-164.
73. Hardy, S. 1976. Synthesis of LISP programs from examples. In Proceedings of the 4th International Joint Conference on Artificial Intelligence (Tibilsi, Georgia, USSR, Sept.). International Joint Council on Artificial Intelligence, pp. 265-273.
74. Hayes-Roth, F., and McDermott, J. 1978. An interference matching technique for inducing abstractions. Commun. ACM 21, 5 (May), 401-411.
75. Horning, J. J. 1969. A study of grammatical inference. Ph.D. dissertation, Computer Science Dept., Stanford Univ., Stanford, Calif.
76. Jantke, K. P. 1979. Natural properties of strategies Identifying recursive functions. Etektron. Informationsverarb. Kybern. (EIK) 15, 487-496.
77. Jantke, K. P., and Beick, H, R. 1981. Combining postulates of naturalness in inductive inference.
78. Elektron. Informationsverarb. Kybern. (EIK) 17, 465-484.
79. JOUANNAUD, J. P., AND GuiHO, G. 1979. Inference of functions with an interactive system. In Machine Intelligence 9, J. E. Hayes, D. Michie, and L. I. Milculich, Eds. Wiley, New York, pp. 227-250.
80. JOUANNAUD, J. P., AND KODKATOFF, Y. 1979. Characterization of a claaa of functions synthesized by a Summers-like method using a B.M.W. matching technique. In Proceedings of the 6th International Joint Conference on Artificial Intelligence (Tokyo, Aug.). International Joint Clouncil on Artificial Intelligence, pp. 440-447.
81. JOUANNAUD, J. p., AND KODRATOFF, Y. 1980. An automatic construction of LISP programs by transformations of functions synthesized from their input output behavior. Int. J. Policy Ancdy. Inf. Syst. 4, 331-358.
82. JOUANNAUD, J. P., GuIHO, 6., AND TREUIL, T. P. 1977. SISP/1, an interactive system able to synthesize functions from examples. In Proceedings of the 5th International Joint Conference on Artificial Intelligence (Cambridge, Mass., Aug.). International Joint Council on Artificial InteUi-gence, pp. 412-418.
83. Juno, H. 1977. Zur Untersuchung von abstrakten interaktiven Erkennungssyatemen. Ph.D. disaer-tation, Humbolt University, Berlin, GDR.
84. Klette, R., and Wiehagen, R. 1980. Research in the theory of inductive inference by GDR mathematicians-A survey. Inf Sci. 22, 149-169.
85. Knobe, B., and Knobe, K, 1976. A method for inferring context-free grammars. Inf CorUrol 31, 129-146.
86. Kodhatoff, Y. 1979. A class of functions synthesized from a finite number of examples and a LISP program scheme. Int. J. Comput. Inf. Sci. 8, 489-521.
87. Kodratofp, Y., and Fargues, J. 1978. A sane algorithm for the synthesis of LISP functions from example problems. In Proceedings of the AISB/GI Conference on Artificial Intelligence (Hamburg, July). Society for the Study of Artificial intelligence and Simulation of Behavior/Geaellachaft für Informatik, pp. 169-175.
88. Kolmogorov, A. N. 1965. Three approaches to the quantitative definition of infonnation. Probl. Inf. Transm. 1, 1-7.
89. Kugel, p. 1977. Induction, pure and simple. Inf. Control 35, 276-336.
90. Laudan, L. 1977. Progress and Its Problems. University of California Press, Berkeley, Calif.
91. Levine, B. 1981. Derivatives of tree sets with applications to grammatical inference. IEEE Trans. Pattern Anal. Mack. Intell. PAMI-3, 285-293.
92. Levine, B. 1982. The use of tree derivatives and a sample support parameter for inferring tree systems. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-4, 25-34.
93. Lindner, R. 1972. Algorithmische Brkennung. Ph.D. dissertation, Friedrich-Schiller-Univeisi-tat, Jena, G.D.R.
94. Machtey, M., and Young, P. 1978. An Introduction to the General Theory of Algorithms. Elsevier North-Holland, New York.
95. Martin-Lof, P. 1966. The definition of random sequences. Inf. Control 9, 602-619.
96. Martin-Lof, P. 1971. Complexity oscillations in infinite binary strings. Z. WahrscheinUchkeitstheor. Verw. Geb. 19, 225-230.
97. Mahyanski, F. j., and Booth, T. L. 1977. Inference of finite-state probabilistic grammars. IEEE Trans. Comput. C-36, 521-536.
98. Michalski, R. 1980. Pattern recognition aa rule guided inductive inference. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-2, 349-361.
99. Michalski, R., Cabbonell, J., and Mitchell, T., Eds. 1983. Machine Learning. Tioga Publ., Palo Alto, Calif.
100. Miclet, L. 1980. Regular inference with a tail-clustering method. IEEE Trans. Syst. Man Cybern. SMC-10, 737-743.
101. Minicozzi, E. 1976. Some natural properties of strong identification in inductive inference. Theor. Comput. Sci. 2, 345-360.
102. Mitchell, T. M. 1982. Generalization as search. Artif IntelL 18. 203-226.
103. Nix, R. 1983. Editing by example. Ph.D. dissertation, Computer Science Dept., Yale University, New Haven, Conn.
104. Nix, R. 1984. Editing by example. In Proceedings of the nth ACM Symposium on Principjes of Programming Languages, (Salt Lake City, Utah, Jan. 15-18). ACM, New York, pp. 186-195.
105. Osherson, D. N., and Weinstein, S. 1982. Criteria of language learning. Inf Control 52, 123-138.
106. Pao, T. W., and Carr, J. W., III. 1978. A solution of the syntactical induction-inference problem for tegular languages. Comput. Lang. 3, 53-64.
107. Persson, s. 1966. Some sequence extrapolating programs; A study of representation and modeling in inquiring systems. Ph.D. dissertation. Computer Science Dept., Stanford University, Stanford, Calif.
108. Pivar, M., and Finkelstein, M. 1964. Automation, using LISP, of inductive inference on sequences. In The Programming Language LISP, Berkey, Ed. M.I.T. Press, Cambridge, Mass., pp. 125-136.
109. PiVAR, M., and Cord, E. 1964. The LISP program for inductive inference on sequences. In The Programming Language LISP, Berkey, Ed. M.I.T. Press, Cambridge, Mass., pp. 260-289.
110. Plotkin, G. D. 1970. A note on inductive generalization. In Machine Intelligence 5. Elsevier North-Holland, New York, pp. 153-163.
111. Plotkin, G. D. 1971a. Automatic methods of inductive inference. Ph.D. dissertation, Computer Science Dept., Edinburgh University.
112. Plotkin, G. D. 1971b. A further note on inductive generalization. In Machine Intelligence 6. Elsevier North-Holland, New York, pp. 101-124.
113. PODNIEKS, K. M. 1974. Comparing various concepts of function prediction, Part I. Latv. Gosudarst. Univ. Uch. Zapiski 210, 68-81 (in Russian).
114. PODNIEKS, K. M. 1975a. Probabilistic synthesis of enumerated classes of functions. Sov. Math. Dokl. 16, 1042-1045.
115. PoDMEKS, K. M. 1975b. Comparing various concepts of function prediction, Part II. Latv. Gosudarst. Univ. Uch. Zapiski 233, 33-44. (in Russian).
116. Putnam, H. 197S. Probability and confirmation. In Mathematics, Matter and Method. Cambridge Univ. Press, Cambridge, England.
117. Reynolds, J. C. 1970. Transformational systems and the algebraic structure of atomic formulas. In Machine InteUigence 5. Elsevier North-Hol-land, New York, pp. 135-151.
118. Shapiro, E. I981a. Inductive inference of theories from facts. Tech. Rep. 192, Dept, of Computer Science, Yale University, New Haven, Conn.
119. Shapibo, E. 1981b. A general incremental algorithm that infers theories from facts. In Proceedings of the 7th International Joint Conference on Artificial Intelligence (Vancouver, B.C., Canada, Aug.). International Joint Council on Artificial Intelligence, pp. 446-451.
120. Shapibo, E. Y. 1982a. Algorithmic program diagnosis. In Proceedings of the 9th ACM Symposium on Principles of Programming Languages (Albuquerque, N. Mex.). ACM, New York, pp. 299-308.
121. Shapiro, E. 1982b. Algorithmic program debugging. Ph.D. dissertation, Computer Science Dept,, Yale University, 1982. Published by M.I.T. Press, 1983.
122. Shaw, D., Swartout, W., and Green, C. 1975. Inferring LISP programs from example problems. In Proceedings of the 4th International Joint Conference on Artificial InteUigewe (Tibilsi, Georgia, USSR, Sept.). International Joint Council on Artificial Intelligence, pp. 260-267.
123. Shinohara, T. 1982a. Polynomial time inference of extended regular pattern languages. In Proceedings, Software Science and Engineering, Kyoto, Japan.
124. Shinohara, T. 1982b. Polynomial time inference of pattern languages and its applications. In Proceedings of the 7th IBM Symposium on Mathematical Foundations of Computer Science.
125. SiKLOSSY, L., and Sykes, D. 1975. Automatic program synthesis for example problems. InProccedings of the 4th International Joint Conference on Artificial Intelligence (Tibilsi, Georgia, USSR, Sept.). International Joint Council on Artificial Intelligence, pp. 268-273.
126. Simon, H. A., and Kotovskv, K. 1963. Human acquisition of concepts for sequential patterns. Psych. Bev. 70, 534-546.
127. Smith, C. H., 1982. The power of pluralism for automatic program synthesis. J. ACM 29, 4 (Oct.), 1144-1165.
128. Smith, D. R. 1982. A survey of the synthesis of LISP programs from examples. In Automatic Program Construction Techinques, A. W. Biermann, G. Guiho, and Y. Kodratoff, Eds. Macmillan, New York.
129. SOLOMONOFF, R. J. 1964. A formal theory of inductive inference. Inf. Control 7, 1-22, 224-254.
130. SoLOMONOFF, R, J. 1975. Inductive infetenie theory-A unified approach to problems in pattern recognition and artificial intelligence. In Proceedings of the 4th International Conference Artificial InteUigence (Tibilsi, Georgia, USSR, Sept.). International Joint (Council on Artificial Intelligence, pp. 274-280.
131. SOLOMONOFF, R. J. 1978. Complexity-based induction systems: comparisons and convergence theorems. IEEE Trans. Inf. Theor IT-24, 422-432.
132. Stolfo, s. j. 1979. Automatic discovery heuristics for nondeterministic programs from sample execution traces. Ph.D. Dessertation. Computer Science Dept., New York University.
133. Stolfo, s. j., and Hakrison, M. C. 1979. Automatic discovery of heuristics for nondeterministic programs. Tech. Rep. 7, Computer Science Dept., New York University.
134. Summers, P. D. 1976. Program construction from examples. Ph.D. dissertation, Computer Science Dept., Yale University, New Haven, Conn.
135. Summers, P. D. 1977. A methodology for LISP program construction from examples. J. ACM 24. 1 (Jan.), 161-175.
136. Thiele, H. 1973. Lernverfahren zur Erkennung for-malet Sprachen. Kybern. Forsch. 3, 11-93.
137. Thiele, H. 1975. Zur Charakterisierung von Erkennungssytemen mit einbettendem Konvergenzbegriff. KompUziertheit Lern Erkennungsprozessen 2. 188-207. Jena, G.D.R.
138. Van der Mude, A., and Walker, A. 1978. On the inference of stochastic regular grammars. Inf. Control 38, 310-329.
139. Veelenturf, L. P. J. 1978. Inference of sequential machines from sample computations. IEEE Trans. Comput. C-27, 167-170.
140. Verb, S. A. 1980. Multilevel counterfactuals for generalizations of relational concepts and productions. Artif Inteli 14, 139-164.
141. Vere, s. a. 1981, Constrained iV-to-1 generalization. Preprint, Jet Propulsion Laboratory, Pasadena, Calif.
142. Watanabe, s. 1960. Information-theoretical aspects of inductive and deductive inference. IBM J. Res. Devel. 4, 208-231.
143. Waterman, D. A., Faught, W. S., Klahr, P., Rosenschein, S. J., and Wesson, R. 1980. Design issues for exemplary programming. Tech. Rep. N-1484-RC, Rand Corporation, Santa Monica, Calif.
144. Wexler, K., and Cuucover, P. 1980. Formal Principles of Language Acquisition. M.I.T. Press, Cambridge, Mass.
145. Wharton, R. M. 1974. Approximate language identification. Inf. Control 26, 236-265.
146. Wharton, R. M. 1977. Grammar enumeration and inference. Inf. Control 33, 253-272.
147. WiEHAGEN, R. 1976. Limes-erkennung rekursiver Funktionen durch spezielle Stratigen. Ekktron. Informationsverarbeit. Kybem. (EIK) 12, 93-99.
148. WiEHAGEN, R. 1977. Identification of formal languages. In Lecture Notes in Computer Science, vol. 53. Springer-Verlag, New York, pp. 571-579.
149. WiEHAGEN, R. 1978. Characterization problems in the theory of inductive inference. In Proceedings of the 5th Colloquium on Automata, Languages, and Programming (Udine, Italy, July), Lecture Notes on Computer Science, vol. 62. Springer-Verlag, New York, pp. 494-508.
150. WiehaOEN, R., AND Liepe, W. 1976. Charakteristche Eigenschaften von erkennbaren Klassen rekursiver Funktionen. Elektron. Informa-tioftsverarbeit. Kybem. (EIK) 12, 421-438.
151. Winston, P. 1975. Learning Structural Descriptions from Examples. McGraw-Hill, New York.
152. Zloof, M. 1977. Query-by-Example: A data base language. IBM Syst. J. 16, 324-343.
153. ZvoNKiN, A. K., and Levin, L. A. 1970. The complexity of finite objects and the development of the concepts of information and remdomness by means of the theory of algorithms.