Abstract
Purchase PDF (432 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (6)
Purchase PDF (242 K)
doi:10.1016/j.tcs.2003.11.008 
Copyright © 2003 Published by Elsevier B.V.
Learning regular languages using RFSAs*1
Available online 3 December 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Residual languages are important and natural components of regular languages and several grammatical inference algorithms naturally rely on this notion. In order to identify a given target language L, classical inference algorithms try to identify words which define identical residual languages of L. Here, we study whether it could be interesting to perform a tighter analysis by identifying inclusion relations between the residual languages of L. We consider the class of Residual Finite State Automata (RFSAs). An RFSA A is a NonDeterministic Automaton whose states corresponds to residual languages of the language LA it recognizes. The inclusion relations between residual languages of LA can be naturally materialized on A. We prove that the class of RFSAs is not polynomially characterizable. We lead some experiments which show that when a regular language is randomly drawn by using a nondeterministic representation, the number of inclusion relations between its residual languages is very important. Moreover, its minimal RFSA representation is much smaller than its minimal DFA representation. Finally, we design a new learning algorithm, DeLeTe2, based on the search for the inclusion relations between the residual languages of the target language. We give sufficient conditions for the identifiability of the target language. We experimentally compare the performance of DeLeTe2 to those of classical inference algorithms.
Author Keywords: Grammatical inference; Machine learning; Regular languages; Finite state automata
