Re-describing an algorithm by Hopcroft

Theoretical Computer Science

Volumn 250, Issue 1-2, 2001, Pages 333-363

  Knuutila, Timo ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

Algorithms; Finite automata; Minimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; ERROR ANALYSIS; HEURISTIC METHODS;

HOPCROFT ALGORITHMS;

FINITE AUTOMATA;

EID: 0034908266     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0304-3975(99)00150-4     Document Type: Article

References (24)

1. A.V. Aho, J. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1974.
2. N. Blum, An O(n log n) implementation of the standard method for minimizing n-state finite automata, Inform. Process. Lett. 57(2) (1996) 65-69.
3. W. Brauer, Automatentheorie, B. G. Teubner, Stuttgart, 1984.
4. J.R. Büchi, in: D. Siefkes (Ed.), Finite Automata, Their Algebras and Grammars, Springer, New York, 1989.
5. A. Cardon, M. Crochemore, Partitioning a graph in O(|A|log|V|), Theoret. Comput. Sci. 19 (1982) 85-98.
6. J.-M. Champarnaud, G. Hansel, Automate, a computing package for automata and finite semigroups, J. Symbolic Comput. 12 (1991) 197-220.
7. T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
8. F. Gécseg, M. Steinby, Tree Automata, Akadémiai Kiado, Budapest, 1984.
9. D. Gries, Describing an algorithm by Hopcroft, Acta Inform. 2 (1973) 97-109.
10. C.A.R. Hoare, Quicksort, Comput. J. 5(1) (1962) 10-15.
11. J. Hopcroft, An n log n algorithm for minimizing states in a finite automaton, Technical Report CS-190, Stanford University, 1970.
12. J. Hopcroft, An n log n algorithm for minimizing states in a finite automaton, in: Z. Kohavi, A. Paz (Eds.), Proc. Internat. Symp. on the Theory of Machines and Computations, Haifa, Israel, Academic Press, New York, 1971, pp. 189-196.
13. J. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, AddisonWesley, Reading, MA, 1979.
14. O. Matz, A. Miller, A. Potthoff, W. Thomas, E. Valkema, Report on the program AMoRE, Technical Report 9507, Inst. f. Informatik u. Prakt. Math., CAU Kiel, 1995.
15. B. Mikolajczak (Ed.), Algebraic and Structural Automata Theory, Annals of Discrete Mathematics, vol. 44, North-Holland, Amsterdam, 1991.
16. R. Paige, R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16(6) (1987) 973-989.
17. R. Paige, R.E. Tarjan, R. Bonic, A linear time solution for the single function coarsest partition problem, Theoret. Comput. Sci. 40(1) (1984) 67-84.
18. D. Raymond, D. Wood, Grail: A C++ library for automata and expressions, J. Symbolic Comput. 17(4) (1994) 341-350.
19. D. Revuz, Minimization of acylic deterministic automata in linear time, Theoret. Comput. Sci. 92 (1990) 181-189.
20. A. Salomaa, Theory of Automata, Pergamon Press, Oxford, 1969.
21. R. Sedgewick, Implementing quicksort programs, Commun. ACM 21(10) (1978) 847-857.
22. K. Sutner, Implementing finite state machines, in: N. Dean, G. Shannon (Eds.), Computational Support for Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 15, American Mathematical Society, Providence, RI, 1994, pp. 347-364.
23. B. Watson, The design and implementation of the FIRE engine, Technical Report Computer Science Note 94/22, Eindhoven University of Technology, Faculty of Mathematics and Computing Science, 1994.
24. B. Watson, A taxonomy of finite automata minimization algorithms, Technical Report Computer Science Note 93/44, Eindhoven University of Technology, Faculty of Mathematics and Computing Science, 1994.