Abstract
State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata — BC-complexity. Comparison of it with the state complexity is carried out here as well as some interesting minimization properties are discussed. It is shown that minimization of the number of states can lead to a superpolynomial increase of BC-complexity.
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
Nigmatullin, R.: Complexity of Boolean Functions, Moscow (1986) (in Russian)
Barzdins, J., Trakhtenbrot, B.: Finite Automata. Behavior and Synthesis, Moscow (1970) (in Russian)
Boppana, R.B.: The complexity of Finite Functions, New York (1989)
Straubing, H.: Automata, Formal Logic and Circuit Complexity. Birkhäuser, Basel (1994)
Savage, J.E.: Models of Computation: Exploring the Power of Computing. Addison Wesley, Reading (1998)
Karp, R.M., Lipton, R.J.: Some connections between nonuniform and uniform complexity classes. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, STOC 1980 (1980)
Mealy, G.H.: A Method to Synthesizing Sequential Circuits. Bell Systems Technical Journal, 1045–1079 (1955)
Hopcroft, J.E.: An n log n algorithm for minimizing states in finite automata, Technical Report STAN-CS-71-190. Stanford University, Computer Science Department (1971)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Gramlich, G., Schnitger, G.: Minimizing NFAs and regular expressions. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 399–411. Springer, Heidelberg (2005)
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
Valdats, M. (2011). Transition Function Complexity of Finite Automata. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22600-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-22600-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22599-4
Online ISBN: 978-3-642-22600-7
eBook Packages: Computer ScienceComputer Science (R0)