Inferring pure context-free languages from positive data

 Takeshi Koshiba 1 - Erkki Mäkinen 2 - Yuji Takada 3

  Acta Cybernetica 14 (2000) 469-477.

Abstract:

 We study the possibilities to infer pure context-free languages 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.

Footnotes

  1.  High Performance Computing Research Center, Fujitsu Laboratories Ltd., Present address: Telecommunications Advancement Organization of Japan, 1-1-32 Shin'urashima, Kanagawa-ku, Yokohama 221-0031, Japan, e-mail: koshiba@acm.org 2.  Department of Computer Science, University of Tampere, P.O. Box 607, FIN-33101 Tampere, Finland, e-mail: em@cs.uta.fi 3.  Personal Systems Labs., Fujitsu Laboratories Ltd., 2-2-1 Momochihama, Sawara-ku, Fukuoka 814, Japan, e-mail: yuji@flab.fujitsu.co.jp

 Kocsorne Sebo Marianna