A characterization of overlap-free morphisms
Discrete Applied Mathematics
On repetition-free binary words of minimal density
Theoretical Computer Science
Overlap-free words on two symbols
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
In 1982, Séébold showed that the only overlap-free binary words that are the fixed points of non-identity morphisms are the Thue–Morse word and its complement. We strengthen Séébold’s result by showing that the same result holds if the term ‘overlap-free’ is replaced with ‘$\frac{7}{3}$-power-free’. Furthermore, the number $\frac{7}{3}$ is best possible.