Learning efficiency of very simple grammars from positive data

The class of very simple grammars is known to be polynomial-time identifiable in the limit from positive data. This paper gives an even more general discussion on the efficiency of identification of very simple grammars from positive data, which includes both positive and negative results. In particular, we present an alternative efficient inconsistent learning algorithm for very simple grammars.

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

[2]  Alexander Clark,et al.  Polynomial Identification in the Limit of Substitutable Context-free Languages , 2005 .

[3]  Etsuji Tomita,et al.  Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data , 2004, ICGI.

[4]  Ryo Yoshinaka.  Learning Efficiency of Very Simple Grammars from Positive Data , 2007, ALT.

[5]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[6]  Takashi Yokomori.  Erratum to "Polynomial-time identification of very simple grammars from positive data" [Theoret. Comput. Science 298 (2003) 179-206] , 2007, Theor. Comput. Sci..

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

[8]  Colin de la Higuera,et al.  Characteristic Sets for Polynomial Grammatical Inference , 1997, Machine Learning.

[9]  Etsuji Tomita,et al.  A Fast Algorithm for Checking the Inclusion for Very Simple Deterministic Pushdown Automata , 1993 .

[10]  Rémi Eyraud,et al.  Polynomial Identification in the limit of context-free substitutable languages , 2007 .

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

[12]  T. Yokomori.  On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata , 1995, Machine Learning.

[13]  Rolf Wiehagen,et al.  Ignoring data may be the only way to learn efficiently , 1994, J. Exp. Theor. Artif. Intell..

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

[15]  Ryo Yoshinaka.  Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data , 2006, ICGI.

[16]  Takashi Yokomori,et al.  Polynomial-time identification of very simple grammars from positive data , 2003, Theor. Comput. Sci..

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

[18]  Matti Linna,et al.  Two Decidability Results for Deterministic Pushdown Automata , 1979, J. Comput. Syst. Sci..

[19]  Yuji Takada.  Grammatical Interface for Even Linear Languages Based on Control Sets , 1988, Inf. Process. Lett..