Abstract
We study the nondeterministic state complexity of basic regular operations on the classes of prefix-, suffix-, factor-, and subword-free and -convex regular languages. For the operations of intersection, union, concatenation, square, star, reversal, and complementation, we get the tight upper bounds for all considered classes except for complementation on factor- and subword-convex languages. Most of our witnesses are described over optimal alphabets. The most interesting result is the describing of a proper suffix-convex language over a five-letter alphabet meeting the upper bound \(2^n\) for complementation.
Research supported by VEGA grant 2/0084/15 and grant APVV-15-0091. This work was conducted as a part of PhD study of Michal Hospodár and Peter Mlynárčik at the Faculty of Mathematics, Physics and Informatics of the Comenius University.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Birget, J.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43(4), 185–190 (1992). doi:10.1016/0020-0190(92)90198-5
Brzozowski, J., Jirásková, G., Li, B., Smith, J.: Quotient complexity of bifix-, factor-, and subword-free regular languages. Acta Cybernetica 21(4), 507–527 (2014)
Brzozowski, J.: Complexity in convex languages. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 1–15. Springer, Heidelberg (2010). doi:10.1007/978-3-642-13089-2_1
Brzozowski, J.A., Jirásková, G., Li, B.: Quotient complexity of ideal languages. Theoret. Comput. Sci. 470, 36–52 (2013). doi:10.1016/j.tcs.2012.10.055
Brzozowski, J.A., Jirásková, G., Zou, C.: Quotient complexity of closed languages. Theory Comput. Syst. 54(2), 277–292 (2014). doi:10.1007/s00224-013-9515-7
Cmorik, R., Jirásková, G.: Basic operations on binary suffix-free languages. In: Kotásek, Z., Bouda, J., Černá, I., Sekanina, L., Vojnar, T., Antoš, D. (eds.) MEMICS 2011. LNCS, vol. 7119, pp. 94–102. Springer, Heidelberg (2012). doi:10.1007/978-3-642-25929-6_9
Han, Y., Salomaa, K.: Nondeterministic state complexity for suffix-free regular languages. In: McQuillan, I., Pighizzini, G. (eds.) DCFS 2010. EPTCS, vol. 31, pp. 189–196 (2010). doi:10.4204/EPTCS.31.21
Han, Y., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fundam. Inform. 90(1–2), 93–106 (2009). doi:10.3233/FI-2009-0008
Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14(6), 1087–1102 (2003). doi:10.1142/S0129054103002199
Hospodár, M., Jirásková, G., Mlynárčik, P.: Nondeterministic complexity of operations on closed and ideal languages. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 125–137. Springer, Cham (2016). doi:10.1007/978-3-319-40946-7_11
Jirásková, G.: State complexity of some operations on binary regular languages. Theoret. Comput. Sci. 330(2), 287–298 (2005). doi:10.1016/j.tcs.2004.04.011
Jirásková, G., Masopust, T.: Complexity in union-free regular languages. Internat. J. Found. Comput. Sci. 22(7), 1639–1653 (2011). doi:10.1142/S0129054111008933
Jirásková, G., Mlynárčik, P.: Complement on prefix-free, suffix-free, and non-returning NFA languages. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 222–233. Springer, Cham (2014). doi:10.1007/978-3-319-09704-6_20
Jirásková, G., Olejár, P.: State complexity of intersection and union of suffix-free languages and descriptional complexity. In: Bordihn, H., et al. (eds.) NCMA 2009, vol. 256, pp. 151–166. Austrian Computer Society (2009). books.ocg.at
Mlynárčik, P.: Complement on free and ideal languages. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 185–196. Springer, Cham (2015). doi:10.1007/978-3-319-19225-3_16
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. 1, pp. 41–110. Springer, Heidelberg (1997)
Acknowledgment
We would like to thank Jozef Jirásek, Jr., for his help with finding the suffix-convex witness for complementation and for fruitful discussions on the topic.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Hospodár, M., Jirásková, G., Mlynárčik, P. (2017). Nondeterministic Complexity of Operations on Free and Convex Languages. In: Carayol, A., Nicaud, C. (eds) Implementation and Application of Automata. CIAA 2017. Lecture Notes in Computer Science(), vol 10329. Springer, Cham. https://doi.org/10.1007/978-3-319-60134-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-60134-2_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60133-5
Online ISBN: 978-3-319-60134-2
eBook Packages: Computer ScienceComputer Science (R0)