Conjectures and results on morphisms generating k-power-free words
Résumé
After giving an overview about morphisms and k-power-freeness (k in N), 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.