论文信息 - Inferring Uniquely Terminating Regular Languages from Positive Data

Inferring Uniquely Terminating Regular Languages from Positive Data

We define a new subclass of regular languages, called uniquely terminating regular languages, which can be inferred from positive data. The class of uniquely terminating regular languages and the previously known subclasses of regular languages inferable from positive data are incomparable.

Erkki Mäkinen

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

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

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

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

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

[6] Michael A. Arbib,et al. An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

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

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

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

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

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