On the complexity of Hopcroft's State minimization algorithm

Lecture Notes in Computer Science

Volumn 3317, Issue , 2005, Pages 35-44

  Berstel, Jean ^a   Carton, Olivier ^b  

^a Université de Marne la Vallée   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; AUTOMATION; CHARACTER RECOGNITION;

HOPCROFT'S ALGORITHMS; ONE-LETTER ALPHABET; STATE MINIMIZATION;

COMPUTATIONAL COMPLEXITY;

EID: 23944479713     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30500-2_4     Document Type: Conference Paper

References (15)

1. Hopcroft, J.E., Ullman, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley (1969)
2. Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. In Kohavi, Z., Paz, A., eds.: Theory of Machines and Computations, Academic Press (1971) 189-196
3. Krivol, S.L.: Algorithms for minimization of finite acyclic automata and pattern matching in terms. Cybernetics 27 (1991) 324-331 translated from Kibernetika, No 3, May-June 1991, pp. 11-16.
4. Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theoret. Comput. Sci. 92 (1992) 181-189
5. Daciuk, J.: Comparison of construction algorithms for minimal, acyclic, deterministic finite-state automata from sets of strings. In Champarnaud, J.M., Maurel, D., eds.: 7th Implementation and Application of Automata (CIAA 2002). Volume 2608 of Lect. Notes in Comput. Sci., Springer Verlag (2002) 255-261
6. 2 |V|). Theoret. Comput. Sci. 19 (1982) 85-98
7. Paige, R., Tarjan, R.E., Bonic, R.: A linear time solution for the single function coarsest partition problem. Theoret. Comput. Sci. 40 (1985) 67-84
8. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 18 (1987) 973-989
9. Gai, A.T.: Algorithmes de partionnement: minimisation d'automates et applications aux graphes. Mémoire de DEA, Université Montpellier II (2003)
10. Gries, D.: Describing an algorithm by Hopcroft. Acta Inform. 2 (1973) 97-109
11. Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)
12. Beauquier, D., Berstel, J., Chrétienne, P.: Eléments d'algorithmique. Masson (1992)
13. Blum, N.: A O(n log n) implementation of the standard method for minimizing n-state finite automata. Inform. Proc. Letters 57 (1996) 65-69
14. Knuutila, T.: Re-describing an algorithm by Hopcroft. Theoret. Comput. Sci. 250 (2001) 333-363
15. Tutte, W.T.: Graph Theory. Volume 21 of Encyclopedia of Mathematics and its Applications. Addison-Wesley (1984)