Conjectures and results on morphisms generating k-power-free words - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2004

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.
Fichier non déposé

Dates et versions

hal-00598220 , version 1 (05-06-2011)

Identifiants

  • HAL Id : hal-00598220 , version 1

Citer

Gwenaël Richomme, Patrice Séébold. Conjectures and results on morphisms generating k-power-free words. International Journal of Foundations of Computer Science, 2004, 15 (2), pp.307-316. ⟨hal-00598220⟩
22 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More