Shuffle of ω-words: Algebraic aspects

(Extended Abstract)
  • Alexandru Mateescu
Automata and Formal Languages I
Part of the Lecture Notes in Computer Science book series (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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [2]
    O. Carton, Mots Infinis, ω-Semigroupes et Topologie, Universite Paris 7, 1993.Google Scholar
  3. [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. [4]
    J. S. Golan, The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science, Longman Scientific and Technical, Harlow, Essex, 1992.MATHGoogle Scholar
  5. [5]
    M. Lothaire, Combinatorics on Words, Addison Wesley, vol. 17 Encyclopedia of Mathematics and its Applications, 1983.Google Scholar
  6. [6]
    A. Mateescu and G.D. Mateescu, “Associative shuffle of infinite words”, TUGS Technical Report, 104, 1997.Google Scholar
  7. [7]
    A. Mateescu, G. Rozenberg and A. Salomaa, “Shuffle on Trajectories: Syntactic Constraints”, Technical Report 96-18, University of Leiden, 1996.Google Scholar
  8. [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. [9]
    D. Perrin and J. E. Pin, Mots Infinis, Report LITP 93.40, 1993.Google Scholar
  10. [10]
    L. Staiger, “ω-Languages”, in Handbook of Formal Languages, ed. G. Rozenberg and A. Salomaa, Springer, 1997, Vol. 3, 339–388.Google Scholar
  11. [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

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Alexandru Mateescu
    • 1
    • 2
  1. 1.Turku Centre for Computer ScienceTurkuFinland
  2. 2.Department of MathematicsUniversity of BucharestRomania

Personalised recommendations