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.
KeywordsLearning from examples hierarchy of language families even linear grammars regular languages control sets
Unable to display preview. Download preview PDF.
- [Kha74]Nabil A. Khabbaz. A geometric hierarchy of languages. Journal of Computer and System Sciences, 8:142–157, 1974.Google Scholar
- [OG92]José Oncina and Pedro García. Identifying regular languages in polynomial time. In H. Bunke, editor, Advances in structural and syntactic pattern recognition, pages 99–108. World Scientific, Singapore, 1992.Google Scholar
- [RN88]V. Radhakrishnan and G. Nagaraja. Inference of even linear grammars and its application to picture description languages. Pattern Recognition, 21(1):55–62, 1988.Google Scholar
- [Sal73]Arto Salomaa. Formal Languages. Academic Press, New York, 1973.Google Scholar
- [Tak88]Yuji Takada. Grammatical inference for even linear languages based on control sets. Information Processing Letters, 28(4):193–199, 1988.Google Scholar
- [Tak92]Yuji Takada. Algorithmic Learning Theory of Formal Languages and its Applications. Doctoral thesis, Hokkaido University, 1992. Also published as IIAS Research Report RR-93-6E.Google Scholar