Abstract
Union-free expressions are used in union normal form to decompose any regular language to a finite union of union-free languages. Based on the automata characterisation of the union-free languages, by restricting the 1CFPAs not to have transitions by the empty word, or to be deterministic, the n-union-free and the deterministic union-free languages are defined. Union-complexity as a measure of descriptional complexity of regular languages was introduced recently. By the minimum number of union-free/n-union-free/deterministic union-free languages needed to get a regular language as their union, its union-complexity/n-union-complexity/d-union-complexity is defined. It is already known that union-complexity and n-union-complexity are finite for every regular language, however there are regular languages with infinite d-union-complexity. Operational union-complexity, that is, to predict the union-complexity of a language obtained by a language operation from languages with known union-complexity is an important and interesting question belonging to the field of descriptional complexity of formal systems. In the present paper, the Kleene plus, the positive Kleene closure operator is studied. As the Kleene star and plus operations have very different effects on the union-free languages, it is an interesting problem to investigate how the union-complexities may change under this operation. In particular, we show that the union-complexity of a regular language is not growing when this operation is being applied on it. On the other hand, the n-union-complexity of the Kleene plus of an n-union-free language remains 1, but the n-union-complexity of the Kleene plus of other regular languages may grow. Further, the deterministic union-complexity may jump to an infinite value even if the original language had a relatively small deterministic union-complexity, e.g., 4.
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 subscriptionsReferences
Afonin, S., Golomazov, D.: Minimal union-free decompositions of regular languages. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 83–92. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00982-2_7
Brzozwski, J.A.: Regular expression techniques for sequential circuits. Ph.D Dissertation, Department of Electrical Engineering, Princeton University, Princeton, NJ, June 1962
Brzozowski, J.A., Davies, S.: Most complex deterministic union-free regular languages. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 37–48. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94631-3_4
Crvenković, S., Dolinka, I., Ésik, Z.: On equations for union-free regular languages. Inform. Comput. 164(1), 152–172 (2001)
Holzer, M., Kutrib, M.: Structure and complexity of some subregular language families. In: The Role of Theory in Computer Science, pp. 59–82 (2017)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, Reading MA (1979)
Jirásková, G., Masopust, T.: Complexity in union-free regular languages. Int. J. Found. Comput. Sci. 22, 1639–1653 (2011)
Jirásková, G., Nagy, B.: On union-free and deterministic union-free languages. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 179–192. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33475-7_13
Kutrib, M., Wendlandt, M.: Expressive capacity of subregular expressions. RAIRO ITA: Theory Inf. Appl. 52(2–3–4), 201–218 (2018)
Nagy, B.: A normal form for regular expressions. In: Calude, C.S., Calude, E., Dinnen M.J. (eds.) Supplemental Papers for DLT 2004 (8th International Conference Developments in Language Theory), CDMTCS Report 252, Auckland, pp. 51–60 (2004)
Nagy, B.: Union-free regular languages and 1-cycle-free-path-automata. Publ. Math. Debrecen 68, 183–197 (2006)
Nagy, B.: On union-complexity of regular languages, CINTI. In: 11th IEEE International Symposium on Computational Intelligence and Informatics 2010, pp. 177–182 (2010)
Nagy, B.: Union-freeness, deterministic union-freeness and union-complexity. In: Hospodár, M., Jirásková, G., Konstantinidis, S. (eds.) DCFS 2019. LNCS, vol. 11612, pp. 46–56. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-23247-4_3
Nagy, B.: Union-freeness revisited – between deterministic and non-deterministic union-free languages. Int. J. Found. Comput. Sci. 32, 551–573 (2021)
Nagy, B.: Operational union-complexity. Inform. Comput. 284, 104692 (2022)
Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2008)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 41–110. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59136-5_2
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 IFIP International Federation for Information Processing
About this paper
Cite this paper
Nagy, B. (2022). Union-Complexities of Kleene Plus Operation. In: Han, YS., Vaszil, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2022. Lecture Notes in Computer Science, vol 13439. Springer, Cham. https://doi.org/10.1007/978-3-031-13257-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-031-13257-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-13256-8
Online ISBN: 978-3-031-13257-5
eBook Packages: Computer ScienceComputer Science (R0)
