Automatic Learning of Subclasses of Pattern Languages

Automatic classes are classes of languages for which a finite automaton can decide membership question for the languages in the class, in a uniform way, given an index for the language. For alphabet size of at least 4, every automatic class of erasing pattern languages is contained, for some constant n, in the class of all languages generated by patterns which contain (1) every variable only once and (2) at most n symbols after the first occurrence of a variable. It is shown that such a class is automatically learnable using a learner with long-term memory bounded by the length of the first example seen. The study is extended to show the learnability of related classes such as the class of unions of two pattern languages of the above type.

[1]  Sasha Rubin,et al.  Automata Presenting Structures: A Survey of the Finite String Case , 2008, Bulletin of Symbolic Logic.

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

[3]  Sanjay Jain,et al.  Robust Learning of Automatic Classes of Languages , 2011, ALT.

[4]  Robert H. Sloan,et al.  BOOK REVIEW: "SYSTEMS THAT LEARN: AN INTRODUCTION TO LEARNING THEORY, SECOND EDITION", SANJAY JAIN, DANIEL OSHERSON, JAMES S. ROYER and ARUN SHARMA , 2001 .

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

[6]  B. Khoussainov,et al.  Logic Colloquium 2007: Three lectures on automatic structures , 2008, 0809.3430.

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

[8]  Henning Fernau,et al.  Identification of function distinguishable languages , 2000, Theor. Comput. Sci..

[9]  Satoshi Kobayashi,et al.  Locality, Reversibility, and Beyond: Learning Languages from Positive Data , 1998, ALT.

[10]  Dana Angluin,et al.  Inference of Reversible Languages , 1982, JACM.

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

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

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

[14]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

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

[16]  Kenneth Wexler,et al.  Formal Principles of Language Acquisition , 1980 .

[17]  Rolf Wiehagen,et al.  Polynomial-time inference of arbitrary pattern languages , 2009, New Generation Computing.

[18]  Thomas Zeugmann,et al.  Incremental Learning from Positive Data , 1996, J. Comput. Syst. Sci..

[19]  Daniel Reidenbach,et al.  A non-learnable class of E-pattern languages , 2006, Theor. Comput. Sci..

[20]  John Case,et al.  Learning a subclass of regular patterns in polynomial time , 2006, Theor. Comput. Sci..

[21]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[22]  Sanjay Jain,et al.  Learnability of automatic classes , 2012, J. Comput. Syst. Sci..

[23]  Takeshi Koshiba.  Typed pattern languages and their learnability , 1995, EuroCOLT.

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

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

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

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

[28]  Leonard Pitt,et al.  Inductive Inference, DFAs, and Computational Complexity , 1989, AII.

[29]  Carl H. Smith,et al.  On the impact of forgetting on learning machines , 1995, JACM.

[30]  Thomas Zeugmann,et al.  Learning indexed families of recursive languages from positive data: A survey , 2008, Theor. Comput. Sci..

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