Polynomial time learning of some multiple context-free languages with a minimally adequate teacher

Ryo Yoshinaka, Alexander Clark

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

We present an algorithm for the inference of some Multiple Context-Free Grammars from Membership and Equivalence Queries, using the Minimally Adequate Teacher model of Angluin. This is an extension of the congruence based methods for learning some Context-Free Grammars proposed by Clark (ICGI 2010). We define the natural extension of the syntactic congruence to tuples of strings, and demonstrate we can efficiently learn the class of Multiple Context-Free Grammars where the non-terminals correspond to the congruence classes under this relation.

本文言語English
ホスト出版物のタイトルFormal Grammar - 16th International Conference, FG 2011, Revised Selected Papers
ページ192-207
ページ数16
DOI
出版ステータスPublished - 2012
外部発表はい
イベント16th International Conference on Formal Grammar, FG 2011 - Ljubljana, Slovenia
継続期間: 2011 8 62011 8 7

出版物シリーズ

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

Other

Other16th International Conference on Formal Grammar, FG 2011
国/地域Slovenia
CityLjubljana
Period11/8/611/8/7

ASJC Scopus subject areas

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

フィンガープリント

「Polynomial time learning of some multiple context-free languages with a minimally adequate teacher」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル