Re-describing an algorithm by Hopcroft
Author:
- 1 January 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 250 (1-2) , 333-363
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An O(n log n) implementation of the standard method for minimizing n-state finite automataInformation Processing Letters, 1996
- Grail: A C++ Library for Automata and ExpressionsJournal of Symbolic Computation, 1994
- Minimisation of acyclic deterministic automata in linear timeTheoretical Computer Science, 1992
- AUTOMATE, a computing package for automata and finite semigroupsJournal of Symbolic Computation, 1991
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Automatentheorie1984
- Partitioning a graph in O(¦A¦log2¦V¦)Theoretical Computer Science, 1982
- Describing an algorithm by HopcroftActa Informatica, 1973
- AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON1971
- QuicksortThe Computer Journal, 1962