Abstract
We give a characterization of morphisms which preserve finite and infinite standard Sturmian words. The class of such morphisms coincides with the monoid {D, E}* of the endomorphisms of A*, where A = {a, b}, generated by the two elementary morphisms, E which interchanges the letter a with b and D which is the Fibonacci morphism defined as: D(a) = ab, D(b) = a. Some new properties of these morphisms are shown. In particular, we derive a new characterization of the set PER of all words w having two periods p and q which are coprimes and such that ¦w¦ = p + q − 2.
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 and A. de Luca, Sturmian words, Lyndon words and trees, Preprint L.I.T.P. 95/24, University of Paris 7, June 95, Theoretical Computer Science, to appear
J. Berstel and P. Séébold, A characterization of Sturmian morphisms, Lect. Notes Comp. Sci. 1993, vol. 711, pp. 281–290.
J. Berstel and P. Séébold, A remark on Morphic Sturmian words, R.A.I.R.O., I.T., 28(1994) 255–263.
J. Berstel and P. Séébold, Morphismes de Sturm, Bull. Belg. Math. Soc. 1 (1994) 175–189.
T.C. Brown, Descriptions of the characteristic sequence of an irrational, Canad. Math. Bull., 36 (1993) 15–21.
D. Crisp, W. Moran, A. Pollington and P. Shiue, Substitution invariant cutting sequences, J. théorie des nombres de Bordeaux, 5(1993) 123–138.
A. de Luca, Sturmian words: Structure, Combinatorics, and their Arithmetics, Theoretical Computer Science, special issue on Formal Languages, to appear.
A. de Luca, On standard Sturmian morphisms, Preprint 95/18 Dipartimento di Matematica Università di Roma “La Sapienza”.
A. de Luca and F. Mignosi, Some Combinatorial properties of Sturmian words, Theoretical Computer Science, 136(1994) 361–385.
M. Lothaire, Combinatorics on words, (Addison-Wesley, Reading, MA, 1983).
F. Mignosi, Infinite words with linear subword complexity, Theoretical Computer Science, 65(1989) 221–242.
F. Mignosi and P. Séébold. Morphismes sturmiens et règles de Rauzy, J. théorie des nombres de Bordeaux, 5(1993) 221–233.
M. Morse and G.A. Hedlund, Symbolic dynamics II: Sturmian trajectories, Amer. J. Math., 62(1940), 1–42.
G. Rauzy, Mots infinis en arithmétique, in M. Nivat and D. Perrin, eds., Automata in Infinite words, Lecture Notes in Computer Science, vol.192 (Springer, Berlin, 1984) pp. 164–171.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Luca, A. (1996). On standard Sturmian morphisms. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_146
Download citation
DOI: https://doi.org/10.1007/3-540-61440-0_146
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61440-1
Online ISBN: 978-3-540-68580-7
eBook Packages: Springer Book Archive