Abstract
In this paper a particular family of deterministic automata that was built to reach the worst case complexity of Hopcroft’s state minimization algorithm is considered. This family is also challenging for the two other classical minimization algorithms: it achieves the worst case for Moore’s algorithm, as a consequence of a result by Berstel et al., and is of at least quadratic complexity for Brzozowski’s solution, which is our main contribution. It therefore constitutes an interesting family, which can be useful to measure the efficiency of implementations of well-known or new minimization algorithms.
Partially supported by MIUR Project Mathematical aspects and emerging applications of automata and formal languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
AitMous, O., Bassino, F., Nicaud, C.: Building the minimal automaton of A*X in linear time, when X is of bounded cardinality. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 275–287. Springer, Heidelberg (2010)
Almeida, M., Moreira, N., Reis, R.: On the performance of automata minimization algorithms. Technical Report DCC-2007-03, Universidade do Porto (2007)
Bassino, F., David, J., Nicaud, C.: On the average complexity of Moore’s state minimization algorithm. In: STACS, pp. 123–134 (2009)
Béal, M.-P., Crochemore, M.: Minimizing local automata. In: IEEE International Symposium on Information Theory (ISIT 2007), pp. 1376–1380 (2007)
Berstel, J., Boasson, L., Carton, O.: Continuant polynomials and worst-case behavior of Hopcroft’s minimization algorithm. TCS 410, 2811–2822 (2009)
Berstel, J., Boasson, L., Carton, O., Fagnot, I.: Sturmian trees. Theory of Computing Systems 46(3), 443–478 (2010)
Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata 12, 529–561 (1962)
Castiglione, G., Restivo, A., Sciortino, M.: Circular sturmian words and Hopcroft’s algorithm. TCS 410, 4372–4381 (2009)
Castiglione, G., Restivo, A., Sciortino, M.: On extremal cases of Hopcroft’s algorithm. TCS 411(38-39), 3414–3422 (2010)
Champarnaud, J.-M., Khorsi, A., Paranthoën, T.: Split and join for minimizing: Brzozowski’s algorithm. In: PSC 2002, pp. 96–104 (2002)
Daciuk, J., Watson, R.E., Watson, B.W.: Incremental construction of acyclic finite-state automata and transducers. In: Finite State Methods in Natural Language Processing, Bilkent University, Ankara, Turkey (1998)
de Luca, A., Mignosi, F.: Some combinatorial properties of Sturmian words. TCS 136(2), 361–385 (1994)
Hopcroft, J.E.: An nlogn algorithm for mimimizing the states in a finite automaton. In: Theory of Machines and Computations, Proc. Internat. Sympos. Technion, Haifa, pp. 189–196. Academic Press, New York (1971)
Moore, E.F.: Gedaken experiments on sequential machines, pp. 129–153. Princeton University Press, Princeton (1956)
Revuz, D.: Minimisation of acyclic deterministic automata in linear time. TCS 92(1), 181–189 (1992)
Tabakov, D., Vardi, M.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 396–411. Springer, Heidelberg (2005)
Watson, B.: A taxonomy of finite automata minimization algorithms. Technical Report 93/44, Eindhoven Univ. of Tech., Faculty of Math. and Comp. Sc. (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castiglione, G., Nicaud, C., Sciortino, M. (2011). A Challenging Family of Automata for Classical Minimization Algorithms. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-18098-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18097-2
Online ISBN: 978-3-642-18098-9
eBook Packages: Computer ScienceComputer Science (R0)