Learning Automatic Families of Languages

A class of languages is automatic if it is uniformly regular using some regular index set for the languages. In this survey we report on work about the learnability in the limit of automatic classes of languages, with some special emphasis to automatic learners.

[1]  Sanjay Jain,et al.  Learning from Positive Data and Negative Counterexamples: A Survey , 2014, Computing with New Resources.

[2]  Sanjay Jain,et al.  ON AUTOMATIC FAMILIES , 2011 .

[3]  Carl H. Smith,et al.  On learning multiple concepts in parallel , 1993, COLT '93.

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

[5]  Sanjay Jain,et al.  Automatic Learning from Positive Data and Negative Counterexamples , 2006, International Conference on Algorithmic Learning Theory.

[6]  Klaus P. Jantke,et al.  Monotonic and Nonmonotonic Inductive Inference of Functions and Patterns , 1990, Nonmonotonic and Inductive Logic.

[7]  Sanjay Jain,et al.  Iterative Learning from Positive Data and Negative Counterexamples , 2007, ALT.

[8]  John Case,et al.  Automatic functions, linear time and learning , 2013, Log. Methods Comput. Sci..

[9]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[10]  Mark A. Fulk.  ROBUST SEPARATIONS IN INDUCTIVE INFERENCE , 1990, COLT 1990.

[11]  John Case,et al.  Robust learning--rich and poor , 2004, J. Comput. Syst. Sci..

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

[13]  John Case,et al.  Automatic Learning of Subclasses of Pattern Languages , 2011, LATA.

[14]  Takeshi Shinohara,et al.  Polynomial Time Inference of Extended Regular Pattern Languages , 1983, RIMS Symposium on Software Science and Engineering.

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

[16]  Daniel N. Osherson,et al.  Learning Strategies , 1982, Inf. Control..

[17]  Sanjay Jain,et al.  Learnability of Automatic Classes , 2010, LATA.

[18]  Gisela Schäfer-Richter,et al.  Über Eingabeabhängigkeit und Komplexität von Inferenzstrategien , 1984 .

[19]  Sanjay Jain,et al.  Uncountable automatic classes and learning , 2009, Theor. Comput. Sci..

[20]  Sanjay Jain,et al.  Parallel learning of automatic classes of languages , 2016, Theor. Comput. Sci..

[21]  Stuart A. Kurtz,et al.  A Refutation of Barzdins' Conjecture , 1989, AII.

[22]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[23]  Sanjay Jain.  Robust Behaviorally Correct Learning , 1999, Inf. Comput..

[24]  Rolf Wiehagen.  Limes-Erkennung rekursiver Funktionen durch spezielle Strategien , 1975, J. Inf. Process. Cybern..

[25]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

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

[27]  John Case,et al.  Automatic Learners with Feedback Queries , 2011, CiE.

[28]  Sanjay Jain,et al.  Robust learning of automatic classes of languages , 2014, J. Comput. Syst. Sci..

[29]  Frank Stephan,et al.  Avoiding coding tricks by hyperrobust learning , 2002, Theor. Comput. Sci..

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

[31]  Carl H. Smith,et al.  Robust Learning Is Rich , 2001, J. Comput. Syst. Sci..