Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Descriptional Complexity of Formal Systems

DCFS 2013: Descriptional Complexity of Formal Systems pp 54–65Cite as

State Complexity of Basic Operations on Non-returning Regular Languages

  • Conference paper

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

Abstract

We consider the state complexity of basic operations on non-returning regular languages. For a non-returning minimal DFA, the start state does not have any in-transitions. We establish the precise state complexity of four Boolean operations (union, intersection, difference, symmetric difference), catenation, reversal, and Kleene-star for non-returning regular languages. Our results are usually smaller than the state complexities for general regular languages and larger than the state complexities for suffix-free regular languages.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J., Perrin, D.: Theory of code. Academic Press, Inc. (1985)

    Google Scholar 

  2. Brzozowski, J.: Derivatives of regular expressions. J. ACM 11, 481–494 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brzozowski, J.: Quotient complexity of regular languages. In: DCFS, pp. 17–28 (2009)

    Google Scholar 

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

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

    MathSciNet  MATH  Google Scholar 

  6. Cmorik, R., Jirásková, G.: Basic operations on binary suffix-free languages. In: Kotásek, Z., Bouda, J., Černá, I., Sekanina, L., Vojnar, T., Antoš, D. (eds.) MEMICS 2011. LNCS, vol. 7119, pp. 94–102. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  7. Domaratzki, M.: State complexity of proportional removals. J. Autom. Lang. Comb. 7, 455–468 (2002)

    MathSciNet  MATH  Google Scholar 

  8. Domaratzki, M., Salomaa, K.: State complexity of shuffle on trajectories. J. Autom. Lang. Comb. 9, 217–232 (2004)

    MathSciNet  MATH  Google Scholar 

  9. Han, Y.-S., Salomaa, K.: State complexity of union and intersection of finite languages. Internat. J. Found. Comput. Sci. 19, 581–595 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Han, Y.-S., Salomaa, K., Wood. D.: Operational state complexity of prefix-free regular languages. In: Automata, Formal Languages, and Related Topics, pp. 99–115 (2009)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Jirásková, G., Šebej, J.: Reversal of binary regular languages. Theoret. Comput. Sci. 449, 85–92 (2012)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Jirásková, G., Okhotin, A.: On the state complexity of star of union and star of intersection. Fund. Inform. 109, 161–178 (2011)

    MathSciNet  MATH  Google Scholar 

  16. Leiss, E.: Succinct representation of regular languages by boolean automata. Theoret. Comput. Sci. 13, 323–330 (1981)

    Google Scholar 

  17. Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Dokl. 11, 1373–1375 (1970)

    MATH  Google Scholar 

  18. Nicaud, C.: Average state complexity of operations on unary automata. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 231–240. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  19. Pighizzini, G., Shallit, J.: Unary language operations, state complexity and Jacobsthal’s function. Internat. J. Found. Comput. Sci. 13, 145–159 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  20. Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. Theoret. Comput. Sci. 383, 140–152 (2007)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  22. Shallit, J.: A second course in formal languages and automata theory. Cambridge University Press, New York (2008)

    Book  Google Scholar 

  23. Wood, D.: Theory of computation. John Wiley & Sons, Inc., New York (1987)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  25. Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb. 6, 221–234 (2001)

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yonsei University, 50, Yonsei-Ro, Seodaemun-Gu, Seoul, 120-749, Republic of Korea

    Hae-Sung Eom & Yo-Sub Han

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

    Galina Jirásková

Authors
  1. Hae-Sung Eom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yo-Sub Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Galina Jirásková
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Middlesex College, Western University, N6A 5B7, London, ON, Canada

    Helmut Jurgensen

  2. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Rua do Campo Alegre 1021-1055,, 4169-007, Porto, Portugal

    Rogério Reis

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eom, HS., Han, YS., Jirásková, G. (2013). State Complexity of Basic Operations on Non-returning Regular Languages. In: Jurgensen, H., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2013. Lecture Notes in Computer Science, vol 8031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39310-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39310-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39309-9

  • Online ISBN: 978-3-642-39310-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation