Polynomial-time identification of an extension of very simple grammars from positive data

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

The class of very simple grammars is known to be polynomialtime identifiable in the limit from positive data. This paper introduces an extension of very simple grammars called right-unique simple grammars, and presents an algorithm that identifies right-unique simple grammars in the limit from positive data. The learning algorithm possesses the following three properties. It computes a conjecture in polynomial time in the size of the input data if we regard the cardinality of the alphabet as a constant. It always outputs a grammar which is consistent with the input data. It never changes the conjecture unless the newly provided example contradicts the previous conjecture. The algorithm has a sub-algorithm that solves the inclusion problem for a superclass of right-unique simple grammars, which is also presented in this paper.

Original languageEnglish
Title of host publicationGrammatical Inference
Subtitle of host publicationAlgorithms and Applications - 8th International Colloquium, ICGI 2006, Proceedings
PublisherSpringer Verlag
Pages45-58
Number of pages14
ISBN (Print)3540452648, 9783540452645
DOIs
Publication statusPublished - 2006
Event8th International Colloquium on Grammatical Inference, ICGI 2006 - Tokyo, Japan
Duration: 2006 Sep 202006 Sep 22

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4201 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Colloquium on Grammatical Inference, ICGI 2006
CountryJapan
CityTokyo
Period06/9/2006/9/22

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Polynomial-time identification of an extension of very simple grammars from positive data'. Together they form a unique fingerprint.

  • Cite this

    Yoshinaka, R. (2006). Polynomial-time identification of an extension of very simple grammars from positive data. In Grammatical Inference: Algorithms and Applications - 8th International Colloquium, ICGI 2006, Proceedings (pp. 45-58). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4201 LNAI). Springer Verlag. https://doi.org/10.1007/11872436_5