Abstract
We show that the class of prefix-free languages is closed under intersection, difference, concatenation, square, and the k-th power and is not closed under complement, union, symmetric difference, Kleene star, reversal, cyclic shift, shuffle, and left quotient. Then, we study the state complexity of difference and left quotient of prefix-free regular languages. In both cases we get tight bounds. In the case of difference, the tight bound is mn − m − 2n + 4 and is met by binary languages. In the case of left quotient, the tight bound is 2n − 1. The bound is met by languages over (n − 1)-letter alphabet and cannot be met using smaller alphabets.
Research supported by VEGA grant 1/0035/09 “Combinatorial Structures and Complexity of Algorithms”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Han, Y.-S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. Automata, Formal Languages, and Related Topics, 99–115 (2009)
Han, Y.-S., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fund. Inform. 90, 93–106 (2009)
Han, Y.-S., Salomaa, K., Yu, S.: State Complexity of Combined Operations For Prefix-Free Regular Languages. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 398–409. Springer, Heidelberg (2009)
Jirásková, G., Krausová, M.: Complexity in prefix-free regular languages. In: McQuillan, I., Pighizzini, G., Trost, B. (eds.) Proc. 12th DCFS, pp. 236–244. University of Saskatchewan, Saskatoon (2010)
Krausová, M.: Prefix-free languages and descriptional complexity. Bachelor thesis. P. J. Šafárik University, Košice, Slovakia (2010) (in Slovak)
Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (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
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krausová, M. (2012). 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) Mathematical and Engineering Methods in Computer Science. MEMICS 2011. Lecture Notes in Computer Science, vol 7119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25929-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-25929-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25928-9
Online ISBN: 978-3-642-25929-6
eBook Packages: Computer ScienceComputer Science (R0)