Skip to main content
SpringerLink
Log in

Square on Ideal, Closed and Free Languages

  • Conference paper
  • First Online:
Descriptional Complexity of Formal Systems (DCFS 2015)

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

Included in the following conference series:

Abstract

We study the deterministic state complexity of a language accepted by an \(n\)-state DFA concatenated with itself for languages from certain subregular classes. Tight upper bounds are obtained on optimal alphabets for prefix-closed, xsided-ideal and xfix-free languages, except for suffix-free, where a ternary alphabet is used.

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 EPUB and 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

References

  1. Brzozowski, J.A., Jirásková, G., Li, B.: Quotient complexity of ideal languages. Theor. Comput. Sci. 470, 36–52 (2013)

    Article  MATH  Google Scholar 

  2. Brzozowski, J.A., Jirásková, G., Li, B., Smith, J.: Quotient complexity of bifix-, factor-, and subword-free regular languages. In: Dömösi, P., Iván, S. (eds.) AFL, pp. 123–137 (2011)

    Google Scholar 

  3. Brzozowski, J.A., Jirásková, G., Zou, C.: Quotient complexity of closed languages. Theor. Comp. Sys. 54(2), 277–292 (2014)

    Article  Google Scholar 

  4. Rampersad, N.: The state complexity of \(L^2\) and \(L^k\). Inf. Process. Lett. 98(6), 231–234 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35), 3209–3222 (2009). DCFS proceedings

    Article  MATH  MathSciNet  Google Scholar 

  6. Brzozowski, J., Ye, Y.: Syntactic complexity of ideal and closed languages. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 117–128. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

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

  8. Jirásková, G., Krausová, M.: Complexity in prefix-free regular languages. In: McQuillan, I., Pighizzini, G. (eds.) DCFS. EPTCS, vol. 31, pp. 197–204 (2010)

    Google Scholar 

  9. Kao, J.Y., Rampersad, N., Shallit, J.: On NFAs where all states are final, initial, or both. Theor. Comput. Sci. 410(4749), 5010–5021 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  10. Čevorová, K., Jirásková, G., Mlynárčik, P., Palmovský, M., Šebej, J.: Operations on automata with all states final. In: Ésik, Z., Fülöp, Z. (eds.) Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27–29, 2014. EPTCS, vol. 151, pp. 201–215 (2014)

    Google Scholar 

  11. Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company, Boston (1997)

    MATH  Google Scholar 

  12. Han, Y.S., Salomaa, K., Wood, D.: State complexity of prefix-free regular languages. In: Descriptional Complexity of Formal Systems, pp. 165–176 (2006)

    Google Scholar 

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

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, Slovak Academy of Sciences, Bratislava, Slovakia

    Kristína Čevorová

Authors
  1. Kristína Čevorová
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kristína Čevorová .

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada

    Jeffrey Shallit

  2. Department of Mathematics, University of Turku, Turku, Finland

    Alexander Okhotin

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Čevorová, K. (2015). Square on Ideal, Closed and Free Languages. In: Shallit, J., Okhotin, A. (eds) Descriptional Complexity of Formal Systems. DCFS 2015. Lecture Notes in Computer Science(), vol 9118. Springer, Cham. https://doi.org/10.1007/978-3-319-19225-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19225-3_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19224-6

  • Online ISBN: 978-3-319-19225-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation