Identification in the limit of k,l-substitutable context-free languages

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

25 Citations (Scopus)

Abstract

Recently Clark and Eyraud (2005, 2007) have shown that substitutable context-free languages are polynomial-time identifiable in the limit from positive data. Substitutability in context-free languages can be thought of as the analogue of reversibility in regular languages. While reversible languages admit a hierarchy, namely k-reversible regular languages for each nonnegative integer k, Clark and Eyraud targeted the subclass of context-free languages that corresponds to zero-reversible regular languages only. Following Clark and Eyraud's proposal, this paper introduces a hierarchy of substitutable context-free languages as the analogue of that of k-reversible regular languages and shows that each class in the hierarchy is also polynomial-time identifiable in the limit from positive data.

Original languageEnglish
Title of host publicationGrammatical Inference
Subtitle of host publicationAlgorithms and Applications - 9th International Colloquium, ICGI 2008, Proceedings
Pages266-279
Number of pages14
DOIs
Publication statusPublished - 2008 Nov 28
Externally publishedYes
Event9th International Colloquium on Grammatical Inference, ICGI 2008 - Saint-Malo, France
Duration: 2008 Sep 222008 Sep 24

Publication series

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

Other

Other9th International Colloquium on Grammatical Inference, ICGI 2008
CountryFrance
CitySaint-Malo
Period08/9/2208/9/24

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Identification in the limit of k,l-substitutable context-free languages'. Together they form a unique fingerprint.

Cite this