Learning languages and functions by erasing

[1]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[2]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[3]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[4]  Boris A. Trakhtenbrot,et al.  Finite automata : behavior and synthesis , 1973 .

[5]  R. V. Freivald.  Minimal Gödel Numbers and Their Identification in the Limit , 1975, MFCS.

[6]  Manuel Blum,et al.  Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

[7]  Rolf Wiehagen.  Inductive Inference of Recursive Functions , 1975, MFCS.

[8]  V. Selivanov.  Enumerations of families of general recursive functions , 1976 .

[9]  Rolf Wiehagen,et al.  Characterization Problems in the Theory of Inductive Inference , 1978, ICALP.

[10]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[11]  Rolf Wiehagen,et al.  Research in the theory of inductive inference by GDR mathematicians - A survey , 1980, Inf. Sci..

[12]  John Case,et al.  Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..

[13]  Rusins Freivalds.  Inductive Inference of Minimal Programs , 1990, COLT.

[14]  Daniel N. Osherson,et al.  Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .

[15]  Rusins Freivalds,et al.  Inductive Inference of Recursive Functions: Qualitative Theory , 1991, Baltic Computer Science.

[16]  Thomas Zeugmann,et al.  Types of monotonic language learning and their characterization , 1992, COLT '92.

[17]  Thomas Zeugmann,et al.  Learning Recursive Languages with Bounded Mind Changes , 1993, Int. J. Found. Comput. Sci..

[18]  Thomas Zeugmann,et al.  Language learning in dependence on the space of hypotheses , 1993, COLT '93.

[19]  Arun Sharma,et al.  Characterizing Language Identification by Standardizing Operations , 1994, J. Comput. Syst. Sci..

[20]  Thomas Zeugmann,et al.  Characterization of language learning front informant under various monotonicity constraints , 1994, J. Exp. Theor. Artif. Intell..

[21]  Carl H. Smith,et al.  Co-learning of total recursive functions , 1994, COLT '94.

[22]  Carl H. Smith,et al.  Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions , 1994, AII/ALT.

[23]  Rusins Freivalds,et al.  Kolmogorov numberings and minimal identification , 1995, EuroCOLT.

[24]  Sanjay Jain.  An Infinite Class of Functions Identifiable Using Minimal Programs in all Kolmogorov Numberings , 1995, Int. J. Found. Comput. Sci..

[25]  Rusins Freivalds,et al.  How Inductive Inference Strategies Discover Their Errors , 1995, Inf. Comput..

[26]  Gianfranco Bilardi,et al.  Language Learning Without Overgeneralization , 1992, Theor. Comput. Sci..

[27]  Martin Kummer.  A Learning-Theoretic Characterization of Classes of Recursive Functions , 1995, Inf. Process. Lett..

[28]  Thomas Zeugmann,et al.  Characterizations of Monotonic and Dual Monotonic Language Learning , 1995, Inf. Comput..

[29]  Thomas Zeugmann,et al.  A Guided Tour Across the Boundaries of Learning Recursive Languages , 1995, GOSLER Final Report.

[30]  Rolf Wiehagen,et al.  Learning by Erasing , 1996, ALT.

[31]  Rusins Freivalds,et al.  Co-Learning of Recursive Languages from Positive Data , 1996, Ershov Memorial Conference.

[32]  John Case,et al.  Synthesizing enumeration techniques for language learning , 1996, COLT '96.

[33]  Rolf Wiehagen,et al.  On Learning and Co-learning of Minimal Programs , 1996, ALT.