Abstract
The theory of Sturmian words is well developed and is an active subject of research (survey in [2]).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnoux, P., Rauzy, G. (1991): Représentation géometrique des suites de complexité 2n + 1. Bull. Soc. Math. France 119, 199–215
Berstel, J., Séébold, P. (2000): Sturmian words. In: Lothaire, M., Algebraic Combinatorics on Words. (Preliminary Version (8 Nov. 2000)). Institut Gaspard Monge, Université Marne-la-Vallée. To appear, pp. 41–98
Berstel, J., Séébold, P. (1994): A remark on morphic Sturmian words. Marne-la-Vallée Inform. Théor. Appl. 28, 255–263
Castelli, M.G., Mignosi, F., Restivo, A. (1999): Fine and Wilf’s theorem for three periods and a generalization of Sturmian words. Theoret. Comput. Sci. 218, 83–94
de Luca, A. (1997): Sturmian words: structure, combinatorics, and their arithmetics. Theoret. Comput. Sci. 183, 45–82
Droubay, X., Justin, X., Pirillo, G. (2000): Episturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci., to appear. See also: Palindrome factors and a characterization by de Luca of standard Sturmian infinite words. LIAFA 98-06, Laboratoire d’Informatique et d’Algorithmique Fondements et Applications, Université de Paris VII, Paris
Droubay, X., Pirillo, G. (1999): Palindromes and Sturmian words. Theoret. Comput. Sci. 223, 73–85
Mignosi, F., Seebold, P.: (1993): Morphismes Sturmiens et règles de Rauzy. J. Théor. Nombres Bordeaux 5, 221–233
Parvaix, B. (1997): Propriétés d’invariance des mots sturmiens. J. Théor. Nombres Bordeaux 9, 351–369
Rauzy, G. (1982): Nombres algébriques et substitutions. Bull. Soc. Math. France 110, 147–178
Rauzy, G. (1985): Mots infinis en arithmétique. In: Nivat, M., Perrin, D. (eds.) Automata on Infinite Words. (Lecture Notes in Computer Science, vol. 194). Springer, Berlin, pp. 165–171
Vandeth, D. (2000): Sturmian words and words with a critical exponent. Theoret. Comput. Sci. 242, 283–300
Vuillon, L. (1999): A characterization of Sturmian words by return words. LIAFA 99/21, Laboratoire d’Informatique et d’Algorthmique Fondements et Applications, Université de Paris VII, Paris
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Italia
About this chapter
Cite this chapter
Justin, J. (2001). Episturmian words and morphisms (results and conjectures). In: Crapo, H., Senato, D. (eds) Algebraic Combinatorics and Computer Science. Springer, Milano. https://doi.org/10.1007/978-88-470-2107-5_23
Download citation
DOI: https://doi.org/10.1007/978-88-470-2107-5_23
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-2159-4
Online ISBN: 978-88-470-2107-5
eBook Packages: Springer Book Archive