Abstract
We introduce a new measure of descriptional complexity on finite automata, called the number of active states. Roughly speaking, the number of active states of an automaton A on input w counts the number of different states visited during the most economic computation of the automaton A for the word w. This concept generalizes to finite automata and regular languages in a straightforward way. We show that the number of active states of both finite automata and regular languages is computable, even with respect to nondeterministic finite automata. We further compare the number of active states to related measures for regular languages. In particular, we show incomparability to the radius of regular languages and that the difference between the number of active states and the total number of states needed in finite automata for a regular language can be of exponential order.
Similar content being viewed by others
References
Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185–190 (1992)
Bordihn, H., Holzer, M.: On the number of active symbols in L and CD grammar systems. J. Autom. Lang. Comb. 6(4), 411–426 (2001)
Burch, J.R., Clarke, E.M., McMillan, K.L.: Symbolic model checking: \(10^{20}\) states and beyond. Inform. Comput. 98(2), 142–170 (1992)
Ellul, K.: Descriptional complexity measures of regular languages. Master thesis, Computer Science, University of Waterloo, Ontario, Canada (2002)
Gill, A., Kou, L.T.: Multiple-entry finite automata. J. Comput. Syst. Sci. 9, 1–19 (1974)
Holzer, M., Kutrib, M.: Nondeterministic finite automata-recent results on the descriptional and computational complexity. Int. J. Found. Comput. Sci. 20(4), 563–580 (2009)
Kleijn, H.C.M., Rozenberg, G.: A study in parallel rewriting systems. Inform. Control 44, 134–163 (1980)
Lockefeer, L.: Formal specification and verification of TCP extended with the Window Scale Option. Master thesis, Vrije Universiteit Amsterdam, The Netherlands (2013)
Wood, D.: Theory of Computation. Wiley, Hoboken (1987)
Yokomori, T., Wood, D., Lange, K.-J.: A three-restricted normal form theorem for ET0L languages. Inform. Process. Lett. 14(3), 97–100 (1982)
Yokomori, T., Wood, D., Lange, K.-J.: Erratum: a three-restricted normal form theorem for ET0L languages. Inform. Process. Lett. 21(1), 53 (1985)
Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb. 6, 221–234 (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This is a completely revised and expanded version of a paper presented at the 22nd Conference on Implementation and Application of Automata (CIAA) held in Marne-la-Vallée, France, June 27–30, 2017.
M. Holzer: Part of the work was done while the author was at Institut für Informatik, Technische Universität München, Arcisstraße 21, 80290 München, Germany and at Institut für Informatik, Technische Universität München, Boltzmannstraße 3, 85748 Garching bei München, Germany.
Rights and permissions
About this article
Cite this article
Bordihn, H., Holzer, M. On the number of active states in finite automata. Acta Informatica 58, 301–318 (2021). https://doi.org/10.1007/s00236-021-00397-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00236-021-00397-8