Some properties of the singular words of the Fibonacci word
European Journal of Combinatorics
Sturmian words: structure, combinatorics, and their arithmetics
Theoretical Computer Science - Special issue: formal language theory
A characterization of substitutive sequences using return words
Discrete Mathematics
Lyndon words and singular factors of sturmian words
Theoretical Computer Science
The exact number of squares in Fibonacci words
Theoretical Computer Science
Episturmian words and some constructions of de Luca and Rauzy
Theoretical Computer Science
Episturmian words and episturmian morphisms
Theoretical Computer Science
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
European Journal of Combinatorics
Some properties of the factors of Sturmian sequences
Theoretical Computer Science
Conjugates of characteristic Sturmian words generated by morphisms
European Journal of Combinatorics
Occurrences of palindromes in characteristic Sturmian words
Theoretical Computer Science
Some properties of the Tribonacci sequence
European Journal of Combinatorics
Characterizations of finite and infinite episturmian words via lexicographic orderings
European Journal of Combinatorics
A characterization of fine words over a finite alphabet
Theoretical Computer Science
European Journal of Combinatorics
On a generalization of Christoffel words: epichristoffel words
Theoretical Computer Science
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Hi-index | 5.23 |
This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent results of Damanik and Lenz [D. Damanik, D. Lenz, Powers in Sturmian sequences, European J. Combin. 24 (2003) 377-390, doi:10.1016/S0195-6698(03)00026-X], who studied powers in Sturmian words. The key tools in our analysis are canonical decompositions and a generalization of singular words, which were originally defined for the ubiquitous Fibonacci word. Our main results are demonstrated via some examples, including the k-bonacci word, a generalization of the Fibonacci word to a k-letter alphabet (k=2).