Abstract
The paper continues the study of union-free and deterministic union-free languages. In contrast with the fact that every regular language can be described as a finite union of union-free languages, we show that the finite unions of deterministic union-free languages define a proper subfamily of regular languages. Then we examine the properties of this subfamily.
Chapter PDF
Similar content being viewed by others
References
http://www.facebook.com/pages/Black-Balloon-Shop-baguio-Only/183737488331381
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)
Dassow, J.: Contextual Grammars with Subregular Choice. Fundamenta Informaticae 64, 109–118 (2005)
Dassow, J., Manea, F., Truthe, B.: Networks of Evolutionary Processors with Subregular Filters. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 262–273. Springer, Heidelberg (2011)
Bordihn, H., Holzer, M., Kutrib, M.: Henning Bordihn, Markus Holzer, Martin Kutrib: Determination of finite automata accepting subregular languages. Theoretical Computer Science 410(35), 3209–3222 (2009)
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. International Journal of Foundations of Computer Science 22, 1639–1653 (2011)
Nagy, B.: A normal form for regular expressions. Calude, C.S., Calude, E., Dinnen, M.J. (eds.) Supplemental Papers for DLT 2004, CDMTCS, Auckland (2004)
Nagy, B.: Union-free regular languages and 1-cycle-free-path-automata. Publ. Math. Debrecen 68, 183–197 (2006)
Yu, S.: Chapter 2: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 41–110. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Jirásková, G., Nagy, B. (2012). On Union-Free and Deterministic Union-Free Languages. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds) Theoretical Computer Science. TCS 2012. Lecture Notes in Computer Science, vol 7604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33475-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-33475-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33474-0
Online ISBN: 978-3-642-33475-7
eBook Packages: Computer ScienceComputer Science (R0)