论文信息 - Inferring pure context-free languages from positive data

Inferring pure context-free languages from positive data

We study the possibilities to infer pure context-free langauges from positive data. We can show that while the whole class of pure context-free languages is not inferable from positive data, it has interesting subclasses which have the desired inference property. We study uniform pure languages, i.e., languages generated by pure grammars obeying restrictions on the length of the right hand sides of their productions, and pure languages generated by deterministic pure grammars.

Takeshi Koshiba | Erkki Mäkinen | Yuji Takada

[1] Armen Gabrielian,et al. Pure grammars and pure languages , 1981 .

[2] Derick Wood,et al. Pure Grammars , 1980, Inf. Control..

[3] Walter Bucher,et al. It is Decidable Whether a Regular Language is Pure Context-Free , 1983, Theor. Comput. Sci..

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

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

[6] Takashi Yokomori. Inductive Inference of 0L Languages , 1992 .

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

[8] Noriyuki Tanida,et al. Inductive Inference of Monogenic Pure Context-free Languages , 1994, AII/ALT.

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

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

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

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