Skip to main content
SpringerLink
Log in

Shuffle Quotient and Decompositions

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2295))

Included in the following conference series:

Abstract

We introduce a right congruence relation that is the analogy of the Nerode congruence when catenation is replaced by shuffle. Using this relation we show that for certain subclasses of regular languages the shuffle decomposition problem is decidable. We show that shuffle decomposition is undecidable for context-free languages.

Work supported by Natural Sciences and Engineering Research Council of Canada Grant OGP0147224 and the Bolyai János Research Grant of the Hungarian Academy of Sciences. All correspondence to K. Salomaa, ksalomaa@cs.queensu.ca

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. J. Berstel, L. Boasson. Shuffle factorization is unique. Research report November 1999. http://www-igm.univ-mlv.fr/ berstel/Recherche.html complexity

  2. C. Câmpeanu, K. Salomaa, S. Yu. Tight lower bound for the state complexity of shuffleof regular languages. Accepted for publication in Journal of Automata, Languages and Combinatorics.

    Google Scholar 

  3. P. Caron. Families of locally testable languages. Theoretical Computer Science 242 (2000) 361–376.

    Article  MATH  MathSciNet  Google Scholar 

  4. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.

    Google Scholar 

  5. B. Imreh, M. Ito, M. Katsura. On shuffle closures of commutative regular languages. In: Combinatorics, Complexity & Logic, Proc. of DMTCS’96, Springer-Verlag, 1996, pp. 276–288.

    Google Scholar 

  6. M. Ito, L. Kari, G. Thierrin. Shuffle and scattered deletion closure of languages. Theoretical Computer Science 245 (2000) 115–133.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Jantzen. Extending regular expressions with iterated shuffle. Theoretical Computer Science 38 (1985) 223–247.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. Jedrzejowicz, A. Szepietowski. Shuffle languages are in P. Theoretical Computer Science 250 (2001) 31–53.

    Article  MATH  MathSciNet  Google Scholar 

  9. S. Kim, R. McNaughton, R. McCloskey.Apolynomial time algorithm for the local testability problem of deterministic finite automata. IEEE Trans. Comput. 40 (1991) 1087–1093.

    Article  MathSciNet  Google Scholar 

  10. S. Kim, R. McNaughton. Computing the order of a locally testable automaton. SIAM Journal of Computing 23 (1994) 1193–1215.

    Article  MATH  MathSciNet  Google Scholar 

  11. A. Mateescu, G.D. Mateescu, G. Rozenberg, A. Salomaa. Shuffle-like operations on ω-words. In: New Trends in Formal Languages, Lecture Notes in Computer Science 1218, Springer-Verlag, 1997, 395–411.

    Google Scholar 

  12. A. Mateescu, G. Rozenberg, A. Salomaa. Shuffle on trajectories: Syntactic constraints. Theoretical Computer Science 197 (1998) 1–56.

    Article  MATH  MathSciNet  Google Scholar 

  13. R. McNaughton, S. Papert. Counter-Free Automata. MIT Press, Cambridge, Mass. 1971.

    MATH  Google Scholar 

  14. A. Salomaa. Formal Languages. Academic Press, 1973.

    Google Scholar 

  15. A.N. Trahtman. Optimal estimation on the order of local testability of finite automata. Theoretical Computer Science 231 (2000) 59–74.

    Article  MATH  MathSciNet  Google Scholar 

  16. S. Yu. Regular languages. In: Handbook of Formal Languages, Vol. I, G. Rozenberg and A. Salomaa, eds., Springer-Verlag, pp. 41–110, 1997.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Information Science, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    C. Câmpeanu & K. Salomaa

  2. Department of Applied Informatics, University of Szeged, Árpád tér 2, H-6720, Szeged, Hungary

    S. Vágvölgyi

Authors
  1. C. Câmpeanu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Vágvölgyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Câmpeanu, C., Salomaa, K., Vágvölgyi, S. (2002). Shuffle Quotient and Decompositions. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation