Displaying similar documents to “Return words in Sturmian and episturmian words”

Finite repetition threshold for large alphabets

Golnaz Badkobeh, Maxime Crochemore, Michaël Rao (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We investigate the finite repetition threshold for -letter alphabets, ≥ 4, that is the smallest number for which there exists an infinite -free word containing a finite number of -powers. We show that there exists an infinite Dejean word on a 4-letter alphabet (a word without factors of exponent more than 7/5 ) containing only two 7/5 -powers. For a 5-letter alphabet, we show that there exists an infinite Dejean word containing only 60 5/4 -powers, and we conjecture...

Look and Say Fibonacci

Patrice Séébold (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

The () derivative of a word is obtained by writing the number of consecutive equal letters when the word is spelled from left to right. For example, 1 1 2 3 3) = 2 1 1 2 2 3 (two , one , two ). We start the study of the behaviour of binary words generated by morphisms under the operator, focusing in particular on the Fibonacci word.