Minimisation of acyclic deterministic automata in linear time
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Text algorithms
Re-describing an algorithm by Hopcroft
Theoretical Computer Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Introduction to Algorithms
Canonical derivatives, partial derivatives and finite automaton constructions
Theoretical Computer Science
Incremental construction and maintenance of minimal finite-state automata
Computational Linguistics
A new algorithm for the construction of minimal acyclic DFAs
Science of Computer Programming
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
Theoretical Computer Science
The word problem for ω-terms over DA
Theoretical Computer Science
A graph theoretic approach to automata minimality
Theoretical Computer Science
Minimization of symbolic automata
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.89 |
We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongly connected DFA, the isomorphism problem for a set of strongly connected minimized DFAs, and the minimization of a connected DFA consisting in two strongly connected components, both of which are minimized. We apply this procedure to minimize, in linear time, automata whose nontrivial strongly connected components are cycles.