Skip to main content
SpringerLink
Log in

The State Complexity of Star-Complement-Star

  • Conference paper
Developments in Language Theory (DLT 2012)

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

Included in the following conference series:

Abstract

We resolve an open question by determining matching (asymptotic) upper and lower bounds on the state complexity of the operation that sends a language L to \(\left( \, \overline{L^*} \, \right)^*\).

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. Brzozowski, J., Grant, E., Shallit, J.: Closures in formal languages and Kuratowski’s theorem. Int. J. Found. Comput. Sci. 22, 301–321 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Corless, R., Gonnet, G., Hare, D., Jeffrey, D., Knuth, D.: On the Lambert W function. Adv. Comput. Math. 5, 329–359 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kleitman, D., Markowsky, G.: On Dedekind’s problem: the number of isotone Boolean functions. II. Trans. Amer. Math. Soc. 213, 373–390 (1975)

    MathSciNet  MATH  Google Scholar 

  4. Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Res. Develop. 3, 114–129 (1959)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  7. Sloane, N.J.A.: Online Encyclopedia of Integer Sequences, http://oeis.org

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

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Galina Jirásková

  2. School of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada

    Jeffrey Shallit

Authors
  1. Galina Jirásková
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeffrey Shallit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Deptartment of Electrical Engineering, National Taiwan University, 106, Taipei, Taiwan

    Hsu-Chun Yen

  2. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jirásková, G., Shallit, J. (2012). The State Complexity of Star-Complement-Star. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31653-1_34

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-31653-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation