Inferring pure context-free languages from positive data

Koshiba, Takeshi and Mäkinen, Erkki and Takada, Yuji: Inferring pure context-free languages from positive data. In: Acta cybernetica, (14) 3. pp. 469-477. (2000)

[img]
Preview
Cikk, tanulmány, mű
cybernetica_014_numb_003_469-477.pdf

Download (649kB) | Preview

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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2000
Volume: 14
Number: 3
ISSN: 0324-721X
Page Range: pp. 469-477
Language: angol
Uncontrolled Keywords: Természettudomány
Additional Information: Bibliogr.: p. 476-477.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Apr. 05. 13:16
URI: http://acta.bibl.u-szeged.hu/id/eprint/12639

Actions (login required)

View Item View Item