Properties of the extremal infinite smooth words - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2007

Properties of the extremal infinite smooth words

Résumé

Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal in nite smooth words, with respect to the lexicographical order. The naive algorithm generating them is improved by using a reduction of the De Bruijn graph of their factors. We also study their Lyndon factorizations. Finally, we show that the minimal smooth word over the alphabet f1; 3g belongs to the orbit of the Fibonacci word.
Fichier principal
Vignette du fichier
647-2252-1-PB.pdf (176.29 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-00391418 , version 1 (15-05-2014)

Identifiants

Citer

Srečko Brlek, Guy Melançon, Geneviève Paquin. Properties of the extremal infinite smooth words. Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 2 (2), pp.33-50. ⟨10.46298/dmtcs.412⟩. ⟨hal-00391418⟩
186 Consultations
613 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More