Skip to main content
SpringerLink
Log in

State Complexity of Combined Operations for Prefix-Free Regular Languages

  • Conference paper
Language and Automata Theory and Applications (LATA 2009)

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

Abstract

We investigate the state complexity of combined operations for prefix-free regular languages. Prefix-free minimal deterministic finite-state automata have a unique structural property that plays an important role to obtain the precise state complexity of basic operations. Based on the same property, we establish the precise state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Friedl, J.E.F.: Mastering Regular Expressions. O’Reilly & Associates, Inc., Sebastopol (2002)

    MATH  Google Scholar 

  2. Harel, D., Politi, M.: Modeling Reactive Systems with Statecharts: The Statemate Approach. McGraw-Hill, New York (1998)

    Google Scholar 

  3. Karttunen, L.: Applications of finite-state transducers in natural language processing. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 34–46. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  6. Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theoretical Computer Science 320(2-3), 315–329 (2004)

    Article  MathSciNet  MATH  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. Han, Y.S., Salomaa, K.: State complexity of union and intersection of finite languages. International Journal of Foundations of Computer Science 19(3), 581–595 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. International Journal of Foundations of Computer Science 14(6), 1087–1102 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Han, Y.S., Salomaa, K., Wood, D.: State complexity of prefix-free regular languages. In: Proceedings of DCFS 2006, pp. 165–176 (2006); Full version is submitted for publication

    Google Scholar 

  12. Han, Y.S., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 501–512. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Câmpeanu, 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)

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  15. Domaratzki, M., Salomaa, K.: State complexity of shuffle on trajectories. Journal of Automata, Languages and Combinatorics 9(2-3), 217–232 (2004)

    MathSciNet  MATH  Google Scholar 

  16. Hricko, M., Jirásková, G., Szabari, A.: Union and intersection of regular languages and descriptional complexity. In: Proceedings of DCFS 2005, pp. 170–181 (2005)

    Google Scholar 

  17. Jirásek, J., Jirásková, G., Szabari, A.: State complexity of concatenation and complementation of regular languages. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 178–189. Springer, Heidelberg (2005)

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

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. Salomaa, K., Yu, S.: On the state complexity of combined operations and their estimation. International Journal of Foundations of Computer Science 18, 683–698 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  22. Berstel, J., Perrin, D.: Theory of Codes. Academic Press, Inc., London (1985)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  24. Leiss, E.L.: Succinct representation of regular languages by boolean automata. Theoretical Computer Science 13, 323–330 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  25. Ellul, K., Krawetz, B., Shallit, J., Wang, M.W.: Regular expressions: New results and open problems. Journal of Automata, Languages and Combinatorics 9, 233–256 (2004)

    MathSciNet  MATH  Google Scholar 

  26. Rampersad, N.: The state complexity of L 2 and L k. Information Processing Letters 98(6), 231–234 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Intelligence and Interaction Research Center, KIST, P.O.BOX 131, Cheongryang, Seoul, Korea

    Yo-Sub Han

  2. School of Computing, Queen’s University, Kingston, Ontario, K7L 3N6, Canada

    Kai Salomaa

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

    Sheng Yu

Authors
  1. Yo-Sub Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kai Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sheng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Av. Catalunya, 35, 43002, Tarragona, Spain

    Adrian Horia Dediu

  2. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, Spain

    Armand Mihai Ionescu

  3. European Research Council Executive Agency, 16 Place Rogier, 1210, Brussels, Belgium

    Carlos Martín-Vide

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, YS., Salomaa, K., Yu, S. (2009). State Complexity of Combined Operations for Prefix-Free Regular Languages. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00982-2_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00982-2_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00981-5

  • Online ISBN: 978-3-642-00982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation