Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beal, M.P., Perrin, D.: Symbolic dynamics and finite automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2, pp. 463–505. Springer, Heidelberg (1997)
Berstel, J., Perrin, D.: Theory of codes. Academic Press, Inc., London (1985)
Brzozowski, J.: On Single-Loop Realizations of Sequential Machines. Information and Control 10(3), 292–314 (1967)
Carpi, A., D’Alessandro, F.: Strongly transitive automata and the Černý conjecture. Acta Informatica 46(8), 591–607 (2009)
Eilenberg, S.: Automata, Languages, and Machines, vol. A (1974)
Friedman, A.D.: Feedback in Synchronous Sequential Switching Circuits. IEEE Trans. Electronic Computers EC-15(3), 354–367 (1966)
Gill, A., Kou, L.T.: Multiple-entry finite automata. Journal of Computer and System Sciences 9(1), 1–19 (1974)
Goralcik, P., Koubek, V.: On the Disjunctive Set Problem. Theoretical Computer Science 204(1-2), 99–118 (1998)
Han, Y.S., Wang, Y., Wood, D.: Infix-free Regular Expressions and Languages. International Journal of Foundations of Computer Science 17(2), 379–393 (2006)
Holzer, M., Salomaa, K., Yu, S.: On the state complexity of k-entry deterministic finite automata. Journal of Automata, Languages and Combinatorics 6(4), 453–466 (2001)
Hopcroft, J.E.: An nlogn algorithm for minimizing the states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, Proc. Internat. Sympos. Technion, Haifa, pp. 189–196. Academic Press, New York (1971)
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (1979)
Kao, J.Y., Rampersd, N., Shallit, J.: On NFA’s where all states are final, initial, or both. TCS 410, 5010–5021 (2009)
Lind, D., Marcus, B.: An introduction to symbolic dynamics and coding. Cambridge University Press, New York (1995)
Moore, E.F.: Gedanken-experiments on sequential machines. The Journal of Symbolic Logic 23(1) (1958)
Veloso, P.A.S., Gill, A.: Some remarks on multiple-entry finite automata. Journal of Computer and System Sciences 18, 304–306 (1979)
Volkov, M.V.: Syncronizing automata and the Černý conjecture. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11–27. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Restivo, A., Vaglica, R. (2010). Automata with Extremal Minimality Conditions. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-14455-4_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14454-7
Online ISBN: 978-3-642-14455-4
eBook Packages: Computer ScienceComputer Science (R0)