An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Symbolic dynamics and finite automata
Handbook of formal languages, vol. 2
On the disjunctive set problem
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Automata, Languages, and Machines
Automata, Languages, and Machines
On the state complexity of k-entry deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Codes
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
On NFAs where all states are final, initial, or both
Theoretical Computer Science
Strongly transitive automata and the Černý conjecture
Acta Informatica
Multiple-entry finite automata
Journal of Computer and System Sciences
Some remarks on automata minimality
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Syntactic complexity of ideal and closed languages
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
A graph theoretic approach to automata minimality
Theoretical Computer Science
Extremal minimality conditions on automata
Theoretical Computer Science
| Hi-index | 0.00 |
It is well known that the minimality of a deterministic finite automaton (DFA) depends on the set of final states. In this paper we study the minimality of a strongly connected DFA by varying the set of final states. We consider, in particular, some extremal cases. A strongly connected DFA is called uniformly minimal if it is minimal, for any choice of the set of final states. It is called never-minimal if it is not minimal, for any choice of the set of final states. We show that there exists an infinite family of uniformly minimal automata and that there exists an infinite family of never-minimal automata. Some properties of these automata are investigated and, in particular, we consider the complexity of the problem to decide whether an automaton is uniformly minimal or neverminimal.