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
Externally publishedYes

Fingerprint

Context free languages
Context-free Languages
Grammar
Restriction
Language

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

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

Inferring pure context-free languages from positive data. / Koshiba, Takeshi; Mäkinen, Erkki; Takada, Yuji.

In: Acta Cybernetica, Vol. 14, No. 3, 1999, p. 469-477.

Research output: Contribution to journalArticle

Koshiba, T, Mäkinen, E & Takada, Y 1999, 'Inferring pure context-free languages from positive data', Acta Cybernetica, vol. 14, no. 3, pp. 469-477.
Koshiba, Takeshi ; Mäkinen, Erkki ; Takada, Yuji. / Inferring pure context-free languages from positive data. In: Acta Cybernetica. 1999 ; Vol. 14, No. 3. pp. 469-477.
@article{9956638a024c4e62b8ca44a04bdf456f,
title = "Inferring pure context-free languages from positive data",
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.",
author = "Takeshi Koshiba and Erkki M{\"a}kinen and Yuji Takada",
year = "1999",
language = "English",
volume = "14",
pages = "469--477",
journal = "Acta Cybernetica",
issn = "0324-721X",
publisher = "University of Szeged",
number = "3",

}

TY - JOUR

T1 - Inferring pure context-free languages from positive data

AU - Koshiba, Takeshi

AU - Mäkinen, Erkki

AU - Takada, Yuji

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=9444220043&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=9444220043&partnerID=8YFLogxK

M3 - Article

VL - 14

SP - 469

EP - 477

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 3

ER -