CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
Gwénaël Richomme, Patrice Séébold · International Journal of Foundations of Computer Science · 2004
After giving an overview about morphisms and k-power-freeness (k∈ IN ), we present several conjectures, and partially solve one of those by giving, for any integer k≥3, binary morphisms which are not k-power-free, but which are (k+1)-power-free and generate k-power-free infinite words.