Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1998: STACS 98 pp 150–160Cite as

Shuffle of ω-words: Algebraic aspects

(Extended Abstract)

  • Automata and Formal Languages I
  • Conference paper
  • First Online:

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

Abstract

We introduce and investigate some sets of ω-trajectories that have the following properties: each of them defines an associative and commutative operation of shuffle of ω-words and, moreover, each of them satisfies a certain condition of fairness. The interrelations between these sets are studied as well as with other well-known classes of ω-words, like infinite Sturmian words, periodic and ultimately periodic ω-words.

The work reported here has been supported by the Project 137358 of the Academy of Finland

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel, Recent Results on Sturmian Words, in Developments in Language Theory, eds. J. Dassow, G. Rozenberg and A. Salomaa, World Scientific, 1996, 13–24.

    Google Scholar 

  2. O. Carton, Mots Infinis, ω-Semigroupes et Topologie, Universite Paris 7, 1993.

    Google Scholar 

  3. C. Choffrout and J. Karhumäki, Combinatorics of Words in Handbook of Formal Languages, eds. G. Rozenberg and A. Salomaa, Springer, 1997, 329–438.

    Google Scholar 

  4. J. S. Golan, The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science, Longman Scientific and Technical, Harlow, Essex, 1992.

    MATH  Google Scholar 

  5. M. Lothaire, Combinatorics on Words, Addison Wesley, vol. 17 Encyclopedia of Mathematics and its Applications, 1983.

    Google Scholar 

  6. A. Mateescu and G.D. Mateescu, “Associative shuffle of infinite words”, TUGS Technical Report, 104, 1997.

    Google Scholar 

  7. A. Mateescu, G. Rozenberg and A. Salomaa, “Shuffle on Trajectories: Syntactic Constraints”, Technical Report 96-18, University of Leiden, 1996.

    Google Scholar 

  8. D. Park, “Concurrency and automata on infinite sequences”, in Theoretical Computer Science, ed. P. Deussen, LNCS 104, Springer-Verlag, 1981, 167–183.

    Google Scholar 

  9. D. Perrin and J. E. Pin, Mots Infinis, Report LITP 93.40, 1993.

    Google Scholar 

  10. L. Staiger, “ω-Languages”, in Handbook of Formal Languages, ed. G. Rozenberg and A. Salomaa, Springer, 1997, Vol. 3, 339–388.

    Google Scholar 

  11. W. Thomas, “Automata on Infinite Objects”, in Handbook of Theoretical Computer Science, Volume B, ed. J. van Leeuwen, Elsevier, 1990, 135–191.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Turku Centre for Computer Science, Lemminkäisenkatu 14 A, 20520, Turku, Finland

    Alexandru Mateescu

  2. Department of Mathematics, University of Bucharest, Romania

    Alexandru Mateescu

Authors
  1. Alexandru Mateescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Morvan Christoph Meinel Daniel Krob

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag

About this paper

Cite this paper

Mateescu, A. (1998). Shuffle of ω-words: Algebraic aspects. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028557

Download citation

  • DOI: https://doi.org/10.1007/BFb0028557

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69705-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation