Skip to main content
SpringerLink
Log in

Complexity in Union-Free Regular Languages

  • Conference paper
Developments in Language Theory (DLT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6224))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. JFLAP, http://www.jflap.org/

  2. 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)

    Chapter  Google Scholar 

  3. 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)

    Google Scholar 

  4. Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185–190 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. 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

    Article  MATH  MathSciNet  Google Scholar 

  6. Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theoret. Comput. Sci. 410, 3209–3222 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. 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)

    MATH  MathSciNet  Google Scholar 

  9. Crvenković, S., Dolinka, I., Ésik, Z.: On equations for union-free regular languages. Inform. and Comput. 164, 152–172 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. 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)

    MATH  MathSciNet  Google Scholar 

  11. Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59, 75–77 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Han, Y.-S., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Theoret. Comput. Sci. 410, 2537–2548 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  13. Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Internat. J. Found. Comput. Sci. 14, 1087–1102 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Hromkovič, J.: Communication complexity and parallel computing. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  15. Jirásek, J., Jirásková, G., Szabari, A.: State complexity of concatenation and complementation. Internat. J. Found. Comput. Sci. 16, 511–529 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  16. Jirásková, G.: State complexity of some operations on binary regular languages. Theoret. Comput. Sci. 330, 287–298 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  17. Jirásková, G., Okhotin, A.: State complexity of cyclic shift. Theor. Inform. Appl. 42, 335–360 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  18. 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)

    Google Scholar 

  19. Leiss, L.: Succint representation of regular languages by boolean automata. Theoret. Comput. Sci. 13, 323–330 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  20. Lupanov, O.B.: Über den Vergleich zweier Typen endlicher Quellen. Probl. Kybernetik 6, 328–335 (1966); Translation from Probl. Kibernetiki 9, 321–326 (1963)

    Google Scholar 

  21. 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)

    Google Scholar 

  22. 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)

    Google Scholar 

  23. Mirkin, B.G.: On dual automata. Kibernetika 1, 7–10 (1966)

    MathSciNet  Google Scholar 

  24. 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)

    Article  MATH  Google Scholar 

  25. 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)

    Google Scholar 

  26. Nagy, B.: Union-free regular languages and 1-cycle-free-path automata. Publ. Math. Debrecen 68, 183–197 (2006)

    MATH  MathSciNet  Google Scholar 

  27. Rampersad, N.: The state complexity of L 2 and L k. Inform. Process. Lett. 98, 231–234 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  28. 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)

    Google Scholar 

  29. Salomaa, A.: Formal languages. Academic Press, New York (1973)

    MATH  Google Scholar 

  30. Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theoret. Comput. Sci. 320, 315–329 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  31. Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (1997)

    MATH  Google Scholar 

  32. Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 2, vol. I, pp. 41–110. Springer, Heidelberg (1997)

    Google Scholar 

  33. Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theoret. Comput. Sci. 125, 315–328 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, Slovak Academy of Sciences, Grešákova 6, 040 01, Košice, Slovak Republic

    Galina Jirásková

  2. Mathematical Institute, Czech Academy of Sciences, Žižkova 22, 616 62, Brno, Czech Republic

    Tomáš Masopust

Authors
  1. Galina Jirásková
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tomáš Masopust
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Western Ontario, N6A 5B7, London, ON, Canada

    Yuan Gao , Hanlin Lu , Shinnosuke Seki  & Sheng Yu , ,  & 

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation