Abstract
It is well known that the minimization problem of deterministic finite automata (DFAs) is related to the indistinguishability notion of states (cf. [HMU00]). Indeed, a well known technique to minimize a DFA, essentially, consists in finding pairs of states that are equivalent (or indistinguishable), namely pairs of states (p,q) such that it is impossible to assert the difference between p and q only by starting in each of the two states and asking whether or not a given input string leads to a final state. Since, in the testing states equivalence, the notion of initial state is irrelevant, some of the main techniques for the minimization of automata, such as Moore’s algorithm [Moo56] and Hopcroft’s algorithm [Hop71], do not care what is the initial state of the automaton, when applied to accessible automata (i.e. such that all states can be reached from the initial state). Therefore a natural question that arises is, for accessible automata, on what does minimality depend? Obviously, it depends on both the automata transitions and the set of final states. In this paper, our main focus is to investigate to what extent minimality depends on the particular subset of final states.
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
Goralcik, P., Koubek, V.: On the disjunctive set problem. Theor. Comput. Sci. 204(1-2), 99–118 (1998)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison Wesley, Reading (2000)
Hopcroft, J.E.: An n log n algorithm for minimizing the states in a finite automaton, pp. 189–196. Academic Press, London (1971)
Howie, J.M. (ed.): Automata and Languages. Oxford Science Publications. Oxford University Press, Inc., New York (1991)
Moore, E.F.: Gedanken experiments on sequential machines. In: Moore, E.F. (ed.) Automata Studies, pp. 129–153. Princeton U., Princeton (1956)
Rodaro, E., Silva, P.: Never minimal automata and the rainbow bipartite subgraph problem. In: Proceedings of the 15th International Conference on Developments in Language Theory. Springer, Heidelberg (2011)
Restivo, A., Vaglica, R.: Automata with extremal minimality conditions. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 399–410. Springer, Heidelberg (2010)
Restivo, A., Vaglica, R.: Extremal minimality conditions on automata (2011) (submitted)
Černy, J.: Poznámka k homogénnym experimenton s konečnými automatmi. Mat.-Fyz. Cas. Slovensk. Akad. Vied. 14, 208–215 (1964)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Restivo, A., Vaglica, R. (2011). Some Remarks on Automata Minimality. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-22321-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22320-4
Online ISBN: 978-3-642-22321-1
eBook Packages: Computer ScienceComputer Science (R0)