Inductive inference of monogenic pure context-free languages

Noriyuki Tanida, Takashi Yokomori

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

This paper concerns a subclass of context-free languages, called pure context-free languages, which is generated by context-free grammar with only one type of symbol (i.e., terminals and nonterminals are not distinguished), and investigates the problem of identifying from positive data a restricted class of monogenic pure context-free languages (mono-PCF languages, in short). The class of mono-PCF languages is incomparable to the class of regular languages. We show that the class of mono-PCF languages is polynomial time identifiable from positive data. That is, there is an algorithm that, given a mono- PCF language L, identifies from positive data, a grammar generating L, called a monogenic pure context-free grammar (mono-PCF grammar) satisfying the property that the time for updating a conjecture is bounded by O(N3), where N is the sum of lengths of all positive data provided. This is in contrast with another result in this paper that the class of PCF languages is not identifiable in the limit from positive data.

本文言語English
ホスト出版物のタイトルAlgorithmic Learning Theory - 4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994, Proceedings
編集者Setsuo Arikawa, Klaus P. Jantke
出版社Springer Verlag
ページ560-573
ページ数14
ISBN(印刷版)9783540585206
出版ステータスPublished - 1994 1 1
外部発表はい
イベント4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994 - Reinhardsbrunn Castle, Germany
継続期間: 1994 10 101994 10 15

出版物シリーズ

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

Other

Other4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994
国/地域Germany
CityReinhardsbrunn Castle
Period94/10/1094/10/15

ASJC Scopus subject areas

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

フィンガープリント

「Inductive inference of monogenic pure context-free languages」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル