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

研究成果: Conference contribution

26 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルGrammatical Inference
ホスト出版物のサブタイトルAlgorithms and Applications - 9th International Colloquium, ICGI 2008, Proceedings
ページ266-279
ページ数14
DOI
出版ステータスPublished - 2008 11 28
外部発表はい
イベント9th International Colloquium on Grammatical Inference, ICGI 2008 - Saint-Malo, France
継続期間: 2008 9 222008 9 24

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5278 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other9th International Colloquium on Grammatical Inference, ICGI 2008
国/地域France
CitySaint-Malo
Period08/9/2208/9/24

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Identification in the limit of k,l-substitutable context-free languages」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル