Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Finite repetition threshold for large alphabets

Golnaz BadkobehMaxime CrochemoreMichaël Rao — 2014

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

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 that this number...

Page 1

Download Results (CSV)