On Monotonic Strategies for Learning r.e. Languages

Overgeneralization is a major issue in identification of grammars for formal languages from positive data. Different formulations of monotonic strategies have been proposed to address this problem and recently there has been a flurry of activity investigating such strategies in the context of indexed families of recursive languages.

[1]  Yasuhito Mukouchi,et al.  Characterization of Finite Identification , 1992, AII.

[2]  Shyam Kapur,et al.  Monotonic Language Learning , 1992, ALT.

[3]  Frank Stephan,et al.  Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract). , 1995, COLT 1995.

[4]  Thomas Zeugmann,et al.  Monotonic Versus Nonmonotonic Language Learning , 1991, Nonmonotonic and Inductive Logic.

[5]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

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

[7]  Efim B. Kinber Monotonicity versus Efficiency for Learning Languages from Texts , 1994, AII/ALT.

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

[9]  Gianfranco Bilardi,et al.  Language Learning without Overgeneralization , 1992, STACS.

[10]  Rolf Wiehagen A Thesis in Inductive Inference , 1990, Nonmonotonic and Inductive Logic.

[11]  Shyam Kapur,et al.  Uniform Charakterizations of Various Kinds of Language Learning , 1993, ALT.

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

[13]  Hartley Rogers,et al.  Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.

[14]  Jr. Hartley Rogers Theory of Recursive Functions and Effective Computability , 1969 .

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

[16]  Mark A. Fulk Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..

[17]  Thomas Zeugmann,et al.  Language Learning with a Bounded Number of Mind Changes , 1993, STACS.

[18]  Setsuo Arikawa,et al.  Inductive Inference Machines That Can Refute Hypothesis Spaces , 1993, ALT.

[19]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[20]  Yasuhito Mukouchi Inductive Inference with Bounded Mind Changes , 1992, ALT.

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

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

[23]  Sanjay Jain,et al.  Recursion Theoretic Characterizations of Language Learning , 1989 .