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 never-minimal. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Restivo, A., & Vaglica, R. (2010). Automata with extremal minimality conditions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6224 LNCS, pp. 399–410). https://doi.org/10.1007/978-3-642-14455-4_36
Mendeley helps you to discover research relevant for your work.