Skip to main content
SpringerLink
Log in
Book cover

International Computer Science Symposium in Russia

CSR 2013: Computer Science – Theory and Applications pp 246–257Cite as

Cyclic Shift on Prefix-Free Languages

  • Conference paper

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

Abstract

We prove that the cyclic shift of a prefix-free language represented by a minimal complete n-state deterministic finite automaton is recognized by a deterministic automaton of at most (2n − 3)n − 2 states. We also show that this bound is tight in the quaternary case, and that it cannot be met by using any smaller alphabet. In the ternary and binary cases, we still get exponential lower bounds.

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. Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Process. Letters 43, 185–190 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Gruber, H., Holzer, M.: Language operations with regular expressions of polynomial size. Theoret. Comput. Sci. 410, 3281–3289 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. 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. University of Szeged, Hungary (2009)

    Google Scholar 

  4. Han, Y.-S., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fund. Inform. 90, 93–106 (2009)

    MathSciNet  MATH  Google Scholar 

  5. Han, Y.-S., Salomaa, K., Yu, S.: State complexity of combined operations for prefix-free regular languages. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 398–409. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Jirásková, G., Krausová, M.: Complexity in prefix-free regular languages. In: McQuillan, I., Pighizzini, G., Trost, B. (eds.) Proc. 12th DCFS, pp. 236–244. University of Saskatchewan, Saskatoon (2010)

    Google Scholar 

  7. Jirásková, G., Okhotin, A.: State complexity of cyclic shift. Theor. Inform. Appl. 42, 335–360 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Krausová, M.: Prefix-free regular languages: Closure properties, difference, and left quotient. In: Kotásek, Z., Bouda, J., Černá, I., Sekanina, L., Vojnar, T., Antoš, D. (eds.) MEMICS 2011. LNCS, vol. 7119, pp. 114–122. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

  10. Maslov, A.N.: The cyclic shift of languages. Problemy Peredači Informacii 9, 81–87 (1973) (Russian)

    Google Scholar 

  11. Oshiba, T.: Closure property of the family of context-free languages under the cyclic shift operation. Electron. Commun. Japan 55, 119–122 (1972)

    MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

  14. 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. Institute of Computer Science, Faculty of Science, P.J. Šafárik University, Jesenná 5, 040 01, Košice, Slovakia

    Jozef Jirásek

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

    Galina Jirásková

Authors
  1. Jozef Jirásek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Galina Jirásková
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby, BC, Canada

    Andrei A. Bulatov

  2. Institute of Mathematics and Computer Science, Ural Federal University, 51 Lenina Ave., 620083, Ekaterinburg, Russia

    Arseny M. Shur

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jirásek, J., Jirásková, G. (2013). Cyclic Shift on Prefix-Free Languages. In: Bulatov, A.A., Shur, A.M. (eds) Computer Science – Theory and Applications. CSR 2013. Lecture Notes in Computer Science, vol 7913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38536-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38536-0_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38535-3

  • Online ISBN: 978-3-642-38536-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation