Brlek, Srečko and Melançon, Guy and Paquin, Geneviève - Properties of the extremal infinite smooth words

dmtcs:412 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, Vol. 9 no. 2
Properties of the extremal infinite smooth words

Authors: Brlek, Srečko and Melançon, Guy and Paquin, Geneviève

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.


Source : oai:HAL:hal-00391418v1
Volume: Vol. 9 no. 2
Published on: January 1, 2007
Submitted on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Consultation statistics

This page has been seen 50 times.
This article's PDF has been downloaded 78 times.