Skip to main content
SpringerLink
Log in

State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal

  • Conference paper
Descriptional Complexity of Formal Systems (DCFS 2011)

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

Included in the following conference series:

Abstract

In this paper, we study the state complexities of union and intersection combined with star and reversal, respectively. We obtain the exact bounds for these combined operations on regular languages and show that, as usually, they are different from the mathematical compositions of the state complexities of their individual participating operations.

This work was supported by the Natural Science and Engineering Council of Canada grant 41630.

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. Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of catenation combined with star and reversal. In: Proceedings of Descriptional Complexity of Formal Systems 12th Workshop, Saskatoon, pp. 74–85 (2010)

    Google Scholar 

  2. Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of catenation combined with union and intersection. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 95–104. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Câmpeanu, C., Culik, 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 

  4. Campeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. Journal of Automata, Languages and Combinatorics 7(3), 303–310 (2002)

    MATH  MathSciNet  Google Scholar 

  5. Daley, M., Domaratzki, M., Salomaa, K.: State complexity of orthogonal catenation. In: Proceedings of Descriptional Complexity of Formal Systems 10th Workshop, Charlottetown, pp. 134–144 (2008)

    Google Scholar 

  6. Domaratzki, M.: State complexity and proportional removals. Journal of Automata, Languages and Combinatorics 7, 455–468 (2002)

    MATH  MathSciNet  Google Scholar 

  7. Domaratzki, M., Okhotin, A.: State complexity of power. Theoretical Computer Science 410(24-25), 2377–2392 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ésik, Z., Gao, Y., Liu, G., Yu, S.: Estimation of State Complexity of Combined Operations. Theoretical Computer Science 410(35), 3272–3280 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  9. Gao, Y., Salomaa, K., Yu, S.: The state complexity of two combined operations: star of catenation and star of Reversal. Fundamenta Informaticae 83(1-2), 75–89 (2008)

    MATH  MathSciNet  Google Scholar 

  10. Gao, Y., Yu, S.: State complexity approximation. Electronic Proceedings in Theoretical Computer Science 3, 121–130 (2009)

    Article  Google Scholar 

  11. Holzer, M., Kutrib, M.: State complexity of basic operations on nondeterministic finite automata. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 148–157. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison Wesley, Reading (2001)

    MATH  Google Scholar 

  13. Jirásek, J., Jirásková, G., Szabari, A.: State complexity of concatenation and complementation of regular languages. International Journal of Foundations of Computer Science 16, 511–529 (2005)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. Jirásková, G., Okhotin, A.: State complexity of cyclic shift. In: Proceedings of Descriptional Complexity of Formal Systems 7th Workshop, Como, pp. 182–193 (2005)

    Google Scholar 

  16. Jirásková, G., Okhotin, A.: On the state complexity of star of union and star of intersection, Turku Center for Computer Science TUCS Technical Report No. 825 (2007)

    Google Scholar 

  17. Liu, G., Martin-Vide, C., Salomaa, A., Yu, S.: State complexity of basic language operations combined with reversal. Information and Computation 206, 1178–1186 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  18. Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Mathematics Doklady 11, 1373–1375 (1970)

    MATH  Google Scholar 

  19. Pighizzini, G., Shallit, J.O.: Unary language operations, state complexity and Jacobsthal’s function. International Journal of Foundations of Computer Science 13, 145–159 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  20. Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3(2), 114–125 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  21. Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. Theoretical Computer Science 383, 140–152 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  22. Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theoretical Computer Science 320, 293–313 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  23. Yu, S.: State complexity of regular languages. Journal of Automata, Languages and Combinatorics 6(2), 221–234 (2001)

    MATH  MathSciNet  Google Scholar 

  24. Yu, S., Zhuang, Q., Salomaa, K.: The state complexity of some basic operations on regular languages. Theoretical Computer Science 125, 315–328 (1994)

    Article  MATH  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

  26. Yu, S.: On the state complexity of combined operations. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol. 4094, pp. 11–22. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, London, Ontario, N6A 5B7, Canada

    Yuan Gao & Sheng Yu

Authors
  1. Yuan Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sheng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstraße 2, 35392, Giessen, Germany

    Markus Holzer

  2. Institut für Informatik, Universität Gießen, Arndtstraße 2, 35392, Gießen, Germany

    Martin Kutrib

  3. Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano, Via Comelico 39, 20135, Milano, Italy

    Giovanni Pighizzini

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gao, Y., Yu, S. (2011). State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22600-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22600-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22599-4

  • Online ISBN: 978-3-642-22600-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation