Inferring pure context-free languages from positive data

Takeshi Koshiba, Erkki Mäkinen, Yuji Takada

Research output: Contribution to journalArticle

14 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)469-477
Number of pages9
JournalActa Cybernetica
Volume14
Issue number3
Publication statusPublished - 1999 Jan 1
Externally publishedYes

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

Fingerprint Dive into the research topics of 'Inferring pure context-free languages from positive data'. Together they form a unique fingerprint.

  • Cite this

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