Abstract
A regular language is called union-free if it can be represented by a regular expression that does not contain the union operation. Every regular language can be represented as a finite union of union-free languages (the so-called union-free decomposition), but such decomposition is not necessarily unique. We call the number of components in the minimal union-free decomposition of a regular language the union width of the regular language. In this paper we prove that the union width of any regular language can be effectively computed and we present an algorithm for constructing a corresponding decomposition. We also study some properties of union-free languages and introduce a new algorithm for checking whether a regular language is union-free.
The research presented in this paper was partially supported by the RFBR grant number 09-01-00822-a.
This is a preview of subscription content, log in via an institution to check access.
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
Paz, A., Peleg, B.: On concatenative decompositions of regular events. IEEE Transactions on Computers 17(3), 229–237 (1968)
Brzozowski, J., Cohen, R.: On decompositions of regular events. Journal of the ACM 16(1), 132–144 (1969)
Nagy, B.: A normal form for regular expressions. In: Eighth International Conference on Developments in Language Theory, CDMTCS Technical Report 252, CDMTCS, Auckland, pp. 51–60 (2004)
Brzozowski, J.: Regular expression techniques for sequential circuits. PhD thesis, Princeton University, Princeton, New Jersey (1962)
Ehrenfeucht, A., Zeiger, P.: Complexity measures for regular expressions. In: STOC 1974: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 75–79. ACM, New York (1974)
Afonin, S., Khazova, E.: Membership and finiteness problems for rational sets of regular languages. International Journal of Foundations of Computer Science 17(3), 493–506 (2006)
Leung, H., Podolskiy, V.: The limitedness problem on distance automata: Hashiguchi’s method revisited. Theoretical Computer Science 310(1–3), 147–158 (2004)
Nagy, B.: Programnyelvek elemeinek szintaktikus lersa norml formban (syntactic description of the elements of the programming languages in a normal form). In: IF 2005, Conference on Informatics in Higher Education, Debrecen (2005)
Hashiguchi, K.: Representation theorems on regular languages. Journal of Computer and System Sciences 27, 101–115 (1983)
Brzozowski, J.: Open problems about regular languages. In: Book, R.V. (ed.) Formal Language Theory, Santa Barbara, CA, Univ. of CA at Santa Barbara, pp. 23–47. Academic Press, New York (1980)
Nagy, B.: Union-free languages and 1-cycle-free-path-automata. Publicationes Mathematicae Debrecen 68, 183–197 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afonin, S., Golomazov, D. (2009). Minimal Union-Free Decompositions of Regular Languages. In: Dediu, A.H., Ionescu, A.M., MartÃn-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00982-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-00982-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00981-5
Online ISBN: 978-3-642-00982-2
eBook Packages: Computer ScienceComputer Science (R0)