Polynomial-time identification of multiple context-free languages from positive data and membership queries

研究成果: Conference contribution

9 被引用数 (Scopus)

抄録

This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing where each tuple of strings may occur in sentences of the language of the learning target. Our technique is based on Clark et al.'s work (ICGI 2008) on learning of a subclass of context-free languages. Our algorithm learns those context-free languages as well as many non-context-free languages.

本文言語English
ホスト出版物のタイトルGrammatical Inference
ホスト出版物のサブタイトルTheoretical Results and Applications - 10th International Colloquium, ICGI 2010, Proceedings
ページ230-244
ページ数15
DOI
出版ステータスPublished - 2010 11 12
外部発表はい
イベント10th International Colloquium on Grammatical Inference, ICGI 2010 - Valencia, Spain
継続期間: 2010 9 132010 9 16

出版物シリーズ

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

Other

Other10th International Colloquium on Grammatical Inference, ICGI 2010
国/地域Spain
CityValencia
Period10/9/1310/9/16

ASJC Scopus subject areas

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

フィンガープリント

「Polynomial-time identification of multiple context-free languages from positive data and membership queries」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル