Détails Publication
SQUARE COMPLETION OPERATION OF MAXIMAL SUFFIX IN FIBONACCI WORD,
Auteur(s): K. Ernest Bognini, Idrissa Kaboré, B. Thomas Ouédraogo
Auteur(s) tagués: BOGNINI K. Ernest
Renseignée par : BOGNINI K. Ernest
Résumé

In this paper, we define the notion of maximal suffix duplication and the notion of strict square completion of maximal suffix in an infinite word. Then, we get that each of these operations can be used iteratively to generate the Fibonacci word F. Finally, we show that duplication generates F faster than strict square completion.

Mots-clés

morphism, duplication, strict completion, maximal square, Fibonacci word

939
Enseignants
5607
Publications
49
Laboratoires
84
Projets