Abstract
We investigate the set of all minimal deterministic finite automata accepting a given set of words and rejecting another given set of words. We present several criteria to order the exploration of the corresponding search space. Three criteria are shown to have a very good behavior with respect to the pruning they imply in the search space. Best results have been obtained for the prefix ordering. We have also worked on a new dynamic ordering based on an entropy computation.
Chapter PDF
References
Coste, F. and Nicolas, J.: Regular Inference as a Graph Coloring Problem. Workshop on Grammar Inference, Automata Induction, and Language Acquisition (ICML' 97), Nashville, TN.
Dupont, P.; Miclet, L.; and E.Vidal. What is the search space of the regular inference ? ICGI'94, Grammatical inference and Applications 25–37. Springer Verlag.
Dupont, P. Utilisation et apprentissage de modèles de langages pour la reconnaissance de la parole continue. Ph.D. Dissertation, Ecole Nationale Supérieure des Télécommunications
Lang, K. Random DFA's can be Approximately Learned from Sparse Uniform Examples. In proceedings of the fifth annual ACM Workshop on Computational Learning Theory 45–52, July 1992.
Lang, K. Merge Order count NECI Tech Report, Sept26, 1997
Oncina, J., and Garcia, P. Inferring regular languages in polynomial update time. Pattern Recognition and Image Analysis 49–61.
Quinlan, J.R. Induction of decision trees. Machine Learning (1):81–106.
Trakhenbrot, B. and Barzdin, Y., Finite Automata: Behavior and Synthesis Amsterdam, North Holland Pub. Comp
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coste, F., Nicolas, J. (1998). Inference of finite automata: Reducing the search space with an ordering of pairs of states. In: Nédellec, C., Rouveirol, C. (eds) Machine Learning: ECML-98. ECML 1998. Lecture Notes in Computer Science, vol 1398. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026669
Download citation
DOI: https://doi.org/10.1007/BFb0026669
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64417-0
Online ISBN: 978-3-540-69781-7
eBook Packages: Springer Book Archive