Abstract
The state complexity of the result of a regular operation is often positively correlated with the number of distinct transformations induced by letters in the minimal deterministic finite automaton of the input languages. That is, more transformations in the inputs means higher state complexity in the output. When this correlation holds, the state complexity of a unary operation can be maximized using languages in which there is one letter corresponding to each possible transformation; for operations of higher arity, we can use k-tuples of languages in which there is one letter corresponding to each possible k-tuple of transformations. In this way, a small set of languages can be used as witnesses for many common regular operations, eliminating the need to search for witnesses – though at the expense of using very large alphabets. We formalize this approach and examine its limitations, focusing on the special case of unary operations. We define a class of “uniform” unary operations for which this approach works; the class is closed under composition and includes common operations such as star, reversal, and complement. Our main result is that the worst-case state complexity of a uniform unary operation can be determined by considering just 2n witnesses for each n, where n is the state complexity of the input language.
This work was supported by the Natural Sciences and Engineering Research Council of Canada grant No. OGP0000871.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brzozowski, J.A.: In search of most complex regular languages. Int. J. Found. Comput. Sci. 24(06), 691–708 (2013)
Brzozowski, J., Jirásková, G., Liu, B., Rajasekaran, A., Szykuła, M.: On the state complexity of the shuffle of regular languages. In: Câmpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 73–86. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-41114-9_6
Cho, D.J., Han, Y.S., Ko, S.K., Salomaa, K.: State complexity of inversion operations. Theor. Comput. Sci. 610, 2–12 (2016)
Davies, S.: A general approach to state complexity of operations: formalization and limitations. CoRR abs/1806.08476 (2018). https://arxiv.org/abs/1806.08476
Domaratzki, M.: State complexity of proportional removals. J. Autom. Lang. Comb. 7(4), 455–468 (2002)
Domaratzki, M.: Deletion along trajectories. Theor. Comput. Sci. 320(2), 293–313 (2004)
Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. J. Autom. Lang. Comb. 7(4), 469–486 (2002)
Domaratzki, M., Okhotin, A.: State complexity of power. Theor. Comput. Sci. 410(24), 2377–2392 (2009)
Domaratzki, M., Salomaa, K.: State complexity of shuffle on trajectories. J. Autom. Lang. Comb. 9, 217–232 (2004)
Han, Y.S., Ko, S.K., Salomaa, K.: State complexity of deletion and bipolar deletion. Acta Informatica 53(1), 67–85 (2016)
Jirásková, G., Shallit, J.: The state complexity of star-complement-star. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 380–391. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31653-1_34
Jirásková, G., Šebej, J.: Reversal of binary regular languages. Theor. Comput. Sci. 449, 85–92 (2012)
Jirásková, G., Okhotin, A.: State complexity of cyclic shift. RAIRO-Theor. Inf. Appl. 42(2), 335–360 (2008)
Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: syntactic constraints. Theor. Comput. Sci. 197(1), 1–56 (1998)
Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320(2), 315–329 (2004)
Acknowledgements
I thank Jason Bell, Janusz Brzozowski and the anonymous referees for careful proofreading and helpful comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Davies, S. (2018). A General Approach to State Complexity of Operations: Formalization and Limitations. In: Hoshi, M., Seki, S. (eds) Developments in Language Theory. DLT 2018. Lecture Notes in Computer Science(), vol 11088. Springer, Cham. https://doi.org/10.1007/978-3-319-98654-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-98654-8_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98653-1
Online ISBN: 978-3-319-98654-8
eBook Packages: Computer ScienceComputer Science (R0)