### 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 language | English |
---|---|

Pages (from-to) | 469-477 |

Number of pages | 9 |

Journal | Acta Cybernetica |

Volume | 14 |

Issue number | 3 |

Publication status | Published - 1999 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics

### Cite this

*Acta Cybernetica*,

*14*(3), 469-477.

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

Research output: Contribution to journal › Article

*Acta Cybernetica*, vol. 14, no. 3, pp. 469-477.

}

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

AN - SCOPUS:9444220043

VL - 14

SP - 469

EP - 477

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 3

ER -