Shuffle of ω-words: Algebraic aspects

(Extended Abstract)
  • Alexandru Mateescu
Automata and Formal Languages I

DOI: 10.1007/BFb0028557

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1373)
Cite this paper as:
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


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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