Inductive Inference of Monogenic Pure Context-free Languages
@inproceedings{Tanida1994InductiveIO, title={Inductive Inference of Monogenic Pure Context-free Languages}, author={Noriyuki Tanida and T. Yokomori}, booktitle={AII/ALT}, year={1994} }
This paper concerns a subclass of context-free languages, called pure contextfree languages, which is generated by context-free grammar with only one type of symbol (i.e., terminals and nonterminals are not distinguished), and investigates the problem of identifying from positive data a restricted class of monogenic pure context-free languages (mono-PCF languages, in short). The class of mono-PCF languages is incomparable to the class of regular languages. We show that the class of mono-PCF… CONTINUE READING
Topics from this paper
11 Citations
Comparison results of 2D Monogenic Pure Context Free Picture Grammars with other relating models
- Mathematics
- 2014
e-GRIDS: Computationally Efficient Gramatical Inference from Positive Examples
- Computer Science
- Grammars
- 2004
- 34
eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search
- Computer Science
- ICGI
- 2004
- 23
- PDF
References
SHOWING 1-10 OF 14 REFERENCES
Inductive Inference of Formal Languages from Positive Data
- Computer Science, Mathematics
- Inf. Control.
- 1980
- 828
String Adjunct Grammars: I. Local and Distributed Adjunction
- Computer Science, Mathematics
- Inf. Control.
- 1972
- 20
The Grammatical Inference Problem for the Szilard Languages of Linear Grammars
- Mathematics, Computer Science
- Inf. Process. Lett.
- 1990
- 27