Abstract
We study the Kleene closure operation on regular and prefix-free languages. Using an alphabet of size 2n, we get the contiguous range from 1 to 3/4·2n of complexities of the Kleene closure of regular languages accepted by minimal n-state deterministic finite automata. In the case of prefix-free languages, the Kleene closure may attain just three possible complexities n − 2, n − 1, and n.
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
JFLAP, http://www.jflap.org/
Čevorová, K.: Kleene star on unary regular languages. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 277–288. Springer, Heidelberg (2013)
Geffert, V.: Magic numbers in the state hierarchy of finite automata. Inform. Comput. 205, 1652–1670 (2007)
Han, Y.-S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. In: Automata, Formal Languages, and Related Topics, pp. 99–115. Institute of Informatics, University of Szeged (2009)
Iwama, K., Kambayashi, Y., Takaki, K.: Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs. Theoret. Comput. Sci. 237, 485–494 (2000)
Jirásek, J., Jirásková, G., Szabari, A.: State complexity of concatenation and complementation. Internat. J. Found. Comput. Sci. 16, 511–529 (2005)
Jirásková, G.: State complexity of some operations on binary regular languages. Theoret. Comput. Sci. 330, 287–298 (2005)
Jirásková, G.: On the state complexity of complements, stars, and reversals of regular languages. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 431–442. Springer, Heidelberg (2008)
Jirásková, G.: Magic numbers and ternary alphabet. Internat. J. Found. Comput. Sci. 22, 331–344 (2011)
Jirásková, G., Palmovský, M.: Kleene closure and state complexity. In: Vinar, T. (ed.) ITAT 2013, vol. 2013, pp. 94–100 (2013), CEUR-WS.org
Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Doklady 11, 1373–1375 (1970)
Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (1997)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 41–110. Springer, Heidelberg (1997)
Yu, S., Zhuang, Q., Salomaa, K.: The state complexity of some basic operations on regular languages. Theoret. Comput. Sci. 125, 315–328 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Jirásková, G., Palmovský, M., Šebej, J. (2014). Kleene Closure on Regular and Prefix-Free Languages. In: Holzer, M., Kutrib, M. (eds) Implementation and Application of Automata. CIAA 2014. Lecture Notes in Computer Science, vol 8587. Springer, Cham. https://doi.org/10.1007/978-3-319-08846-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-08846-4_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08845-7
Online ISBN: 978-3-319-08846-4
eBook Packages: Computer ScienceComputer Science (R0)