Automatic Learning of Subclasses of Pattern Languages

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

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

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

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

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

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

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

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

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

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

[11]  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 .

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

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

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

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

[16]  Frank Stephan,et al.  Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity , 1995, Inf. Comput..

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

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

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

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

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

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

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

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

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

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

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

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

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

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