Infinite words with linear subword complexity
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
A characterization of substitutive sequences using return words
Discrete Mathematics
Palindromes and Sturmian words
Theoretical Computer Science
Sturmian words and words with a critical exponent
Theoretical Computer Science
Special factors, periodicity, and an application to Sturmian words
Acta Informatica
Fractional powers in Sturmian words
Theoretical Computer Science
A chararcterization of sturmian words by return words
European Journal of Combinatorics
The index of Sturmian sequences
European Journal of Combinatorics
On the Index of Sturmian Words
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Some properties of the factors of Sturmian sequences
Theoretical Computer Science
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Reversals and palindromes in continued fractions
Theoretical Computer Science
Hi-index | 5.23 |
In this paper we use the relation of the index of an infinite aperiodic word and its recurrence function to give another characterization of Sturmian words. As a by-product, we give a new proof of the theorem describing the index of a Sturmian word in terms of the continued fraction expansion of its slope. This theorem was independently proved in [A. Carpi, A. de Luca, Special factors, periodicity, and an application to Sturmian words, Acta Inform. 36 (2000) 983-1006] and [D. Damanik, D. Lenz, The index of Sturmian sequences, European J. Combin. 23 (2002) 23-29].