Inferring pure context-free languages from positive data

Takeshi Koshiba, Erkki Mäkinen, Yuji Takada

研究成果: Article

14 引用 (Scopus)

抜粋

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.

元の言語English
ページ(範囲)469-477
ページ数9
ジャーナルActa Cybernetica
14
発行部数3
出版物ステータスPublished - 1999 1 1

ASJC Scopus subject areas

  • Software
  • Computer Science (miscellaneous)
  • Computer Vision and Pattern Recognition
  • Management Science and Operations Research
  • Information Systems and Management
  • Electrical and Electronic Engineering

フィンガープリント Inferring pure context-free languages from positive data' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Koshiba, T., Mäkinen, E., & Takada, Y. (1999). Inferring pure context-free languages from positive data. Acta Cybernetica, 14(3), 469-477.