Abstract
We study the star-complement-star operation on prefix-free languages. We get a tight upper bound \(2^{n-3}+2\) for the state complexity of this combined operation on prefix free languages. To prove tightness, we use a binary alphabet. Then we present the results of our computations concerning star-complement-star on binary prefix-free languages. We also show that state complexity of star-complement-star of every unary prefix-free language is one, except for the language \(\{a\}\), where it is two.
M. Palmovský—Research supported by VEGA grant 2/0084/15.
J. Šebej—Research supported by VEGA grant 1/0142/15.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brzozowski, J.A., Grant, E., Shallit, J.: Closures in formal languages and Kuratowski’s theorem. Int. J. Found. Comput. Sci. 22(2), 301–321 (2011). doi:10.1142/S0129054111008052
Eom, H.-S., Han, Y.-S., Salomaa, K.: State complexity of k-union and k-intersection for prefix-free regular languages. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 78–89. Springer, Heidelberg (2013)
Eom, H., Han, Y., Salomaa, K., Yu, S.: State complexity of combined operations for prefix-free regular languages. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Discrete Mathematics and Computer Science. In: Memoriam Alexandru Mateescu (1952–2005), pp. 137–151. The Publishing House of the Romanian Academy (2014)
Han, Y., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fundamenta Informaticae 90(1–2), 93–106 (2009). doi:10.3233/FI-2009-0008
Han, Y., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. In: Ésik, Z., Fülöp, Z. (eds.) Automata, Formal Languages, and Related Topics – Dedicated to Ferenc Gécseg on the occasion of his 70th birthday, pp. 99–115. Institute of Informatics, University of Szeged, Hungary (2009)
Jirásek, J., Jirásková, G.: Cyclic shift on prefix-free languages. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 246–257. Springer, Heidelberg (2013)
Jirásková, G., Palmovský, M.: Kleene closure and state complexity. In: Vinar, T. (ed.) Proceedings of the Conference on Information Technologies – Applications and Theory, Slovakia, 11–15 September 2013. CEUR Workshop Proceedings, vol. 1003, pp. 94–100 (2013). CEUR-WS.org, http://ceur-ws.org/Vol-1003/94.pdf
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)
Krausová, M.: Prefix-free regular languages: closure properties, difference, and left quotient. In: Kotásek, Z., Bouda, J., Černá, I., Sekanina, L., Vojnar, T., Antoš, D. (eds.) MEMICS 2011. LNCS, vol. 7119, pp. 114–122. Springer, Heidelberg (2012)
Maslov, A.: Estimates of the number of states of finite automata. Sov. Math. Dokl. 11, 1373–1375 (1970)
Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. Theor. Comput. Sci. 383(2–3), 140–152 (2007). doi:10.1016/j.tcs.2007.04.015
Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company, Boston (1997)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Word, Language, Grammar, Handbook of Formal Languages, vol. 1, pp. 41–110. Springer, New York (1997)
Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theor. Comput. Sci. 125(2), 315–328 (1994). doi:10.1016/0304-3975(92)00011-F
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Palmovský, M., Šebej, J. (2015). Star-Complement-Star on Prefix-Free Languages. In: Shallit, J., Okhotin, A. (eds) Descriptional Complexity of Formal Systems. DCFS 2015. Lecture Notes in Computer Science(), vol 9118. Springer, Cham. https://doi.org/10.1007/978-3-319-19225-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-19225-3_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19224-6
Online ISBN: 978-3-319-19225-3
eBook Packages: Computer ScienceComputer Science (R0)