Sturmian words and a criterium by Michaux-Villemaire

Authors:
Isabel M. Araújo;Véronique Bruyère
Affiliations:
Departamento de Matemática, Universidade de Évora, Rua Romão Ramalho, 59, 7000-671 Évora, Portugal and Centro de Álgebra da Universidade de Lisboa, Avenida Professor Gama ...;Institut d'Informatique, Université de Mons-Hainaut, Le Pentagone, av. du Champ de Mars, 6, 7000 Mons, Belgium
Venue:
Theoretical Computer Science - Combinatorics on words
Year:
2005

Citing 6
Cited 0

Frequencies of Sturmian series factors

Theoretical Computer Science
Episturmian words and some constructions of de Luca and Rauzy

Theoretical Computer Science
A chararcterization of sturmian words by return words

European Journal of Combinatorics
Generalized balances in Sturmian words

Discrete Applied Mathematics
On a Conjecture of J. Shallit

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations

Quantified Score

Hi-index	0.00

Visualization

Abstract

Michaux and Villemaire's proof of Cobham's theorem relies on the characterization of ultimately periodic words by means of the behaviour of certain repetitions in the word. Namely, they consider the length of the smallest shift between repetitions of a given length and the first position at which that smallest shift is observed. In this paper we study those properties for characteristic Sturmian words. In particular we answer a question posed by Michaux and Villemaire in that context.