Abstract
This chapter is devoted to the most popular algorithms for the induction of automata, namely state merging algorithms. The following three of them are presented: evidence driven state merging, Gold’s algorithm, and an algorithm based on the minimum description length principle. Their common denominator is the merging of two states. All differences result from various particular reasons for choosing the pair of states to do this operation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
The reader can use implementations from the archive http://abbadingo.cs.nuim.ie/dfa-algorithms.tar.gz for the Traxbar and for the two remaining state-merging algorithms.
References
Adriaans PW, Jacobs C (2006) Using MDL for grammar induction. In: Proceedings of grammatical inference: algorithms and applications, 8th international colloquium, ICGI 2006. Tokyo, Japan, 20–22 Sept 2006, pp 293–306
Coste F, Fredouille D (2003) Unambiguous automata inference by means of state-merging methods. In: Proceedings of machine learning: ECML 2003, 14th European conference on machine learning. Cavtat-Dubrovnik, Croatia, 22–26 Sept 2003, pp 60–71
de la Higuera C (2010) Grammatical inference: learning automata and grammars. Cambridge University Press, New York, NY, USA
Gold EM (1978) Complexity of automaton identification from given data. Inf Control 37:302–320
Lang KJ (1992) Random DFA’s can be approximately learned from sparse uniform examples. In: Proceedings of the fifth annual workshop on computational learning theory. ACM, pp 45–52
Lang KJ (1997) Merge order count. Technical report, NECI
Lang KJ, Pearlmutter BA, Price RA (1998) Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Proceedings of the 4th international colloquium on grammatical inference. Springer, pp 1–12
Petasis G, Paliouras G, Karkaletsis V, Halatsis C, Spyropoulos CD (2004) E-GRIDS: computationally efficient grammatical inference from positive examples. Grammars 7:69–110
Trakhtenbrot B, Barzdin Y (1973) Finite automata: behavior and synthesis. North-Holland Publishing Company
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Wieczorek, W. (2017). State Merging Algorithms. In: Grammatical Inference. Studies in Computational Intelligence, vol 673. Springer, Cham. https://doi.org/10.1007/978-3-319-46801-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-46801-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46800-6
Online ISBN: 978-3-319-46801-3
eBook Packages: EngineeringEngineering (R0)