Shuffle of ω-words: Algebraic aspects
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.
KeywordsParallel Composition Atomic Action Fairness Condition Bounded Increase Associative Closure
Unable to display preview. Download preview PDF.
- 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
- O. Carton, Mots Infinis, ω-Semigroupes et Topologie, Universite Paris 7, 1993.Google Scholar
- 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
- M. Lothaire, Combinatorics on Words, Addison Wesley, vol. 17 Encyclopedia of Mathematics and its Applications, 1983.Google Scholar
- A. Mateescu and G.D. Mateescu, “Associative shuffle of infinite words”, TUGS Technical Report, 104, 1997.Google Scholar
- A. Mateescu, G. Rozenberg and A. Salomaa, “Shuffle on Trajectories: Syntactic Constraints”, Technical Report 96-18, University of Leiden, 1996.Google Scholar
- D. Park, “Concurrency and automata on infinite sequences”, in Theoretical Computer Science, ed. P. Deussen, LNCS 104, Springer-Verlag, 1981, 167–183.Google Scholar
- D. Perrin and J. E. Pin, Mots Infinis, Report LITP 93.40, 1993.Google Scholar
- L. Staiger, “ω-Languages”, in Handbook of Formal Languages, ed. G. Rozenberg and A. Salomaa, Springer, 1997, Vol. 3, 339–388.Google Scholar
- W. Thomas, “Automata on Infinite Objects”, in Handbook of Theoretical Computer Science, Volume B, ed. J. van Leeuwen, Elsevier, 1990, 135–191.Google Scholar