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

研究成果: 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

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics

これを引用