Abstract
We continue the investigation of union-free regular languages that are described by regular expressions without the union operation. We also define deterministic union-free languages as languages recognized by one-cycle-free-path deterministic finite automata, and show that they are properly included in the class of union-free languages. We prove that (deterministic) union-freeness of languages does not accelerate regular operations, except for the reversal in the nondeterministic case.
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
JFLAP, http://www.jflap.org/
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)
Aho, A.V., Ullman, J.D., Yannakakis, M.: On notions of information transfer in VLSI circuits. In: Proc. 15th Annual ACM Symposium on the Theory of Computing, pp. 133–139 (1983)
Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185–190 (1992)
Birget, J.-C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theoret. Comput. Sci. 119, 267–291 (1993), http://clam.rutgers.edu/~birget/poWordsERR.ps
Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theoret. Comput. Sci. 410, 3209–3222 (2009)
Câmpeanu, C., Culik II, K., Salomaa, K., Yu, S.: State complexity of basic operations on finite languages. In: Boldt, O., Jürgensen, H. (eds.) WIA 1999. LNCS, vol. 2214, pp. 60–70. Springer, Heidelberg (2001)
Câmpeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. J. Autom. Lang. Comb. 7, 303–310 (2002)
Crvenković, S., Dolinka, I., Ésik, Z.: On equations for union-free regular languages. Inform. and Comput. 164, 152–172 (2001)
Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. J. Autom. Lang. Comb. 7, 469–486 (2002)
Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59, 75–77 (1996)
Han, Y.-S., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Theoret. Comput. Sci. 410, 2537–2548 (2009)
Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Internat. J. Found. Comput. Sci. 14, 1087–1102 (2003)
Hromkovič, J.: Communication complexity and parallel computing. Springer, Heidelberg (1997)
Jirásek, J., Jirásková, G., Szabari, A.: State complexity of concatenation and complementation. Internat. J. Found. Comput. Sci. 16, 511–529 (2005)
Jirásková, G.: State complexity of some operations on binary regular languages. Theoret. Comput. Sci. 330, 287–298 (2005)
Jirásková, G., Okhotin, A.: State complexity of cyclic shift. Theor. Inform. Appl. 42, 335–360 (2008)
Jirásková, G., Okhotin, A.: Nondeterministic state complexity of positional addition. In: Dassow, J., Pighizzini, G., Truthe, B. (eds.) 11th International Workshop on Descriptional Complexity of Formal Systems, pp. 199–210. Otto-von-Guericke-Universität, Magdeburg (2009)
Leiss, L.: Succint representation of regular languages by boolean automata. Theoret. Comput. Sci. 13, 323–330 (1981)
Lupanov, O.B.: Über den Vergleich zweier Typen endlicher Quellen. Probl. Kybernetik 6, 328–335 (1966); Translation from Probl. Kibernetiki 9, 321–326 (1963)
Maslov, A.N.: Estimates of the number of states of finite automata. Sov. Math., Dokl. 11, 1373–1375 (1970); Translation from Dokl. Akad. Nauk SSSR 194, 1266–1268 (1970)
Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Proc. 12th IEEE Symp. on Switching and Automata Theory, pp. 188–191 (1971)
Mirkin, B.G.: On dual automata. Kibernetika 1, 7–10 (1966)
Moore, F.R.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Trans. Comput. 20, 1211–1219 (1971)
Nagy, B.: A normal form for regular expressions. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) CDMTCS-252 report, supplemental material for DLT 2004, pp. 53–62. University of Auckland, New Zealand (2004)
Nagy, B.: Union-free regular languages and 1-cycle-free-path automata. Publ. Math. Debrecen 68, 183–197 (2006)
Rampersad, N.: The state complexity of L 2 and L k. Inform. Process. Lett. 98, 231–234 (2006)
Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proc. 10th Annual ACM Symposium on the Theory of Computing, pp. 275–286 (1978)
Salomaa, A.: Formal languages. Academic Press, New York (1973)
Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theoret. Comput. Sci. 320, 315–329 (2004)
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, ch. 2, vol. I, pp. 41–110. Springer, Heidelberg (1997)
Yu, S., Zhuang, Q., Salomaa, K.: The state complexities 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
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jirásková, G., Masopust, T. (2010). Complexity in Union-Free Regular Languages. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-14455-4_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14454-7
Online ISBN: 978-3-642-14455-4
eBook Packages: Computer ScienceComputer Science (R0)