Inductive Inference of Context-free Languages Based on Context-free Expressions

Takashi Yokomori*

*この研究の対応する著者

研究成果: Article査読

3 被引用数 (Scopus)

抄録

An inductive inference problem of context-free languages is considered. There have been many attempts to this problem, and most of them are based on a problem setup in which a representation space for hypotheses is a class of context-free grammars. An inference algorithm given in this paper, on the contrary, employs a kind of extensions of regular expressions called context-free expressions as a representation space for context-free languages. The algorithm, based on the notion of an identification in the limit, is significantly concise when compared with existing algorithms. Then, a subclass of context-free languages is examined, and a simpler algorithm for the subclass is presented. Further, a topic on meta inductive inference is briefly discussed.

本文言語English
ページ(範囲)115-140
ページ数26
ジャーナルInternational Journal of Computer Mathematics
24
2
DOI
出版ステータスPublished - 1988 1月 1
外部発表はい

ASJC Scopus subject areas

  • コンピュータ サイエンスの応用
  • 計算理論と計算数学
  • 応用数学

フィンガープリント

「Inductive Inference of Context-free Languages Based on Context-free Expressions」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル