• Mathematics, Computer Science
• Published in AII/ALT 1994
• DOI:10.1007/3-540-58520-6_90

Inductive Inference of Monogenic Pure Context-free Languages

@inproceedings{Tanida1994InductiveIO,
  title={Inductive Inference of Monogenic Pure Context-free Languages},
  author={Noriyuki Tanida and Takashi Yokomori},
  booktitle={AII/ALT},
  year={1994}
}

• Noriyuki Tanida, Takashi Yokomori

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

View via Publisher

Save to Library

Create Alert

Cite