Abstract
Sturmian words have been studied for a very long time (Bernoulli [1], Christoffel [3], Markoff [18], Morse and Hedlund [19], Coven and Hedlund [5], Lunnon and Pleasants [17],…). They are infinite words that have exactly n + 1 factors of length n, for each n < 0. Thus they are written in a binary alphabet. Recently a natural and promising generalization to an arbitrary alphabet was presented in [9].
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
Bernoulli, J. (1772): Sur une nouvelle espèce de calcul. In: Recueil pour les Astronomes. Tome 1. Berlin, pp. 255–284
Berstel, J., Séébold, P. (2000): Sturmian words. In: Lothaire, M., Algebraic Combinatorics on Words. (Preliminay Version (8 Nov. 2000)). Insitut Gaspard Monge, Université Marne-la-Vallée. To appear, pp. 41–98
Christoffel, E.B. (1875): Observatio arithmetica. Mat. Ann. 6, 145–152
Coven, E.M. (1974): Sequences with minimal block growth. II. Math. Systems Theory 8, 376–382
Coven, E.M., Hedlund, G.A. (1973): Sequences with minimal block growth. Math. Systems Theory 7, 138–153
de Luca, A. (1997): Sturmian words: structure, combinatorics, and their arithmetics. Theoret. Comput. Sci. 183, 45–82
de Luca, A. (2000): Personal communication, e-mail of 10 January 2000
de Luca, A., Mignosi, F. (1994): Some combinatorial properties of Sturmian words. Theoret. Comput. Sci. 136, 361–385
Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci., to appear
Droubay, X., Pirillo, G. (1999): Palindromes and Sturmian words. Theoret. Comput. Sci. 223, 73–85
Hardy, G. H., Wright, E.M. (1971): An introduction to the theory of numbers. 4th edition. Clarendon Press, Oxford
Justin, J., Pirillo, G. (1997): Decimations and Sturmian words. RAIRO Inform. Théor. Appl. 31, 271–290
Kac, M., Rota G.-C., Schwartz J. T. (1992): Discrete thoughts. Birkhäuser Boston, Boston, MA
Knuth, D.E. (1972): Sequences with precisely k + 1 k-blocks: Solution of problem E2307. Amer. Math. Monthly 79, 773–774
Knuth, D.E. (1973): The art of computer programming. Vol. 3: Sorting and searching. Addison-Wesley, Reading, MA
Lothaire, M. (1983): Combinatorics on words. Addison-Wesley, Reading, MA
Lunnon, W.F., Pleasants, P.A.B. (1992): Characterization of two-distance sequences. J. Austral. Math. Soc. Ser. A 53, 198–218
Markoff, A. (1882): Sur une question de Jean Bernoulli. Math. Ann. 19, 27–36
Morse, M., Hedlund, G.A. (1940): Symbolic dynamics II. Sturmian trajectories. Amer. J. Math. 62, 1–42
Pirillo, G. (1999) From the Fibonacci word to Sturmian words. Publ. Math. Debrecen, 54, Suppl., 961–971
Pirillo, G. (1999): A new characteristic property of the palindrome prefixes of a standard Sturmian word. Sém. Lothar. Combin. 43, Art B43f (electronic)
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
Rota G.-C. (1993): Pensieri discreti. Garzanti, Milano
Rota G.-C. (1997): Indiscrete thoughts. Birkhäuser Boston, Boston, MA
Rota G.-C. (1999): Lezioni napoletane. La Città del Sole, Napoli
Thue, A. (1906): Über unendliche Zeichenreihen. Skr. Norske Vid. Selsk. Kristiania I. Mat. Naturv. Klasse I, 1906(7), 1–22
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Italia
About this chapter
Cite this chapter
Pirillo, G. (2001). A curious characteristic property of standard Sturmian words. In: Crapo, H., Senato, D. (eds) Algebraic Combinatorics and Computer Science. Springer, Milano. https://doi.org/10.1007/978-88-470-2107-5_24
Download citation
DOI: https://doi.org/10.1007/978-88-470-2107-5_24
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-2159-4
Online ISBN: 978-88-470-2107-5
eBook Packages: Springer Book Archive