Abstract
Some shuffle-like operations on infinite (ω-words) are investigated. The operations are introduced using a uniform method based on the notion of an ω-trajectory. We prove an interconnection between associative closure of shuffle on ω-trajectories and periodicity of ω-words. This provides a characterization of the ultimately periodic ω-words. Finally, a remarkable property of the Fibonacci ω-word is exhibited.
This work has been partially supported by the Project 137358 of the Academy of Finland.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
O. Carton, Mots Infinis, ω-Semigroupes et Topologie, These, Universite Paris 7, 1993.
M. Lothaire, Combinatorics on Words, Addison Wesley, vol. 17 Enciclopedia of Mathematics and its Applications, 1983.
A. de Luca, Sturmian words: new combinatorial results in Semigroups, Automata and Languages, eds. J. Almeida, G.M.S. Gomes and P.V. Silva, World Scientific, 1996, 67–84.
A. Mateescu and G.D. Mateescu, “Associative closure and periodicity of ω-words”, submitted.
A. Mateescu, G. Rozenberg and A. Salomaa, “Shuffle on Trajectories: Syntactic Constraints”, Technical Report 96-18, University of Leiden, 1996.
F. Mignosi, A. Restivo and S. Salemi, “A Periodicity Theorem on Words and Applications”, Proceedings of MFCS 1995, eds. J. Wiedermann and P. Hájek, LNCS 969, Springer-Verlag, 1995, 337–348.
D. Park, “Concurrency and automata on infinite sequences”, in Theoretical Computer Science, ed. P. Deussen, LNCS 104, Springer-Verlag, 1981, 167–183.
D. Perrin and J. E. Pin, Mots Infinis, Report LITP 93.40, 1993.
A. Salomaa, “Formal Languages”, Academic Press, 1973.
W. Thomas, “Automata on Infinite Objects”, in Handbook of Theoretical Computer Science, Volume B, ed. J. van Leeuwen, Elsevier, 1990, 135–191.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mateescu, A., Mateescu, G.D. (1997). Associative shuffle of infinite words. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds) Structures in Logic and Computer Science. Lecture Notes in Computer Science, vol 1261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63246-8_18
Download citation
DOI: https://doi.org/10.1007/3-540-63246-8_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63246-7
Online ISBN: 978-3-540-69242-3
eBook Packages: Springer Book Archive