TY - JOUR
T1 - Inductive Inference of Context-free Languages Based on Context-free Expressions
AU - Yokomori, Takashi
PY - 1988/1/1
Y1 - 1988/1/1
N2 - 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.
AB - 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.
KW - Inductive inference algorithm
KW - context-free expression
KW - context-free language
KW - meta inference
UR - http://www.scopus.com/inward/record.url?scp=36749100682&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=36749100682&partnerID=8YFLogxK
U2 - 10.1080/00207168808803637
DO - 10.1080/00207168808803637
M3 - Article
AN - SCOPUS:36749100682
VL - 24
SP - 115
EP - 140
JO - International Journal of Computer Mathematics
JF - International Journal of Computer Mathematics
SN - 0020-7160
IS - 2
ER -