Repository | Book | Chapter
(2001) Algebraic combinatorics and computer science, Dordrecht, Springer.
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].
Publication details
DOI: 10.1007/978-88-470-2107-5_24
Full citation:
Pirillo, G. (2001)., A curious characteristic property of standard sturmian words, in H. Crapo & D. Senato (eds.), Algebraic combinatorics and computer science, Dordrecht, Springer, pp. 541-546.
This document is unfortunately not available for download at the moment.