论文信息 - A Hierarchy of Language Families Learnable by Regular Language Learners

A Hierarchy of Language Families Learnable by Regular Language Learners

We shall establish the existence of a hierarchy of language families, in which the learning problem for each family is reduced to the learning problem for regular languages. Thus this boosts the learnability of learning algorithms for regular languages.

Yuji Takada | Y. Takada

[1] Nabil A. Khabbaz. A Geometric Hierarchy of Languages , 1974, J. Comput. Syst. Sci..

[2] G. R. Putzolu,et al. On a Family of Linear Grammars , 1964, Inf. Control..

[3] Pedro García,et al. IDENTIFYING REGULAR LANGUAGES IN POLYNOMIAL TIME , 1993 .

[4] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.

[5] Yuji Takada. Grammatical Interface for Even Linear Languages Based on Control Sets , 1988, Inf. Process. Lett..

[6] 高田裕志. Algorithmic learning theory of formal languages and its applications , 1993 .

[7] G. Nagaraja,et al. Inference of even linear grammars and its application to picture description languages , 1988, Pattern Recognit..

[8] Horst Bunke,et al. Advances In Structural And Syntactic Pattern Recognition , 1993 .

[9] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..