Inferring regular languages by merging nonterminals

Several subclasses of regular languages are known to be inferable from positive data only. This paper surveys classes of languages originating from the class of reversible languages. We define the classes by using a uniform grammatical notation.

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

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

[3]  Stephen Muggleton,et al.  Inductive acquisition of expert knowledge , 1986 .

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

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

[6]  Jan van Leeuwen,et al.  Worst-case Analysis of Set Union Algorithms , 1984, JACM.

[7]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[8]  Enrique Vidal,et al.  Learning Locally Testable Languages in the Strict Sense , 1990, ALT.

[9]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[10]  Erkki Mäkinen.  A family of languages which is polynomial-time learnable from positive data in pitt's sense , 1996, Int. J. Comput. Math..

[11]  Noriyuki Tanida,et al.  Polynomial-Time Identification of Strictly Regular Languages in the Limit , 1992 .

[12]  Erkki Mäkinen,et al.  On context-free derivations , 1985 .

[13]  Erkki Mäkinen.  The Grammatical Inference Problem for the Szilard Languages of Linear Grammars , 1990, Inf. Process. Lett..

[14]  Giovanni Guida,et al.  Noncounting Context-Free Languages , 1978, JACM.

[15]  K. G. Subramanian,et al.  Learning code regular and code linear languages , 1996, ICGI.

[16]  Arto Salomaa.  Jewels of formal language theory , 1981 .

[17]  Erkki Mäkinen.  Inferring Uniquely Terminating Regular Languages from Positive Data , 1997, Inf. Process. Lett..

[18]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.