Re-describing an algorithm by Hopcroft
Theoretical Computer Science
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Automata with finite congruence lattices
Acta Cybernetica
Description and analysis of a bottom-up DFA minimization algorithm
Information Processing Letters
On the Hopcroft's minimization technique for DFA and DFCA
Theoretical Computer Science
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
Theoretical Computer Science
Circular sturmian words and Hopcroft's algorithm
Theoretical Computer Science
On extremal cases of Hopcroft's algorithm
Theoretical Computer Science
Automata with extremal minimality conditions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
The average complexity of Moore's state minimization algorithm is O(n log log n)
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Some remarks on automata minimality
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Never minimal automata and the rainbow bipartite subgraph problem
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On the complexity of hopcroft’s state minimization algorithm
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Extremal minimality conditions on automata
Theoretical Computer Science
| Hi-index | 5.23 |
The paper presents a graph-theoretic approach to test the minimality of a deterministic automaton. In particular, we focus on problems concerning the dependence of the minimality of an automaton on the choice of the set F of final states or on the cardinality of the set F. We introduce different minimality conditions of an automaton and show that such conditions can be characterized in graph-theoretic terms.