5 research outputs found
Abelian Primitive Words
We investigate Abelian primitive words, which are words that are not Abelian
powers. We show that unlike classical primitive words, the set of Abelian
primitive words is not context-free. We can determine whether a word is Abelian
primitive in linear time. Also different from classical primitive words, we
find that a word may have more than one Abelian root. We also consider
enumeration problems and the relation to the theory of codes
The Standard Factorization of Lyndon Words: an Average Point of View
International audienceA non-empty word w is a Lyndon word if and only if it is strictly smaller for the lexicographical order than any of its proper suffixes. Such a word w is either a letter or admits a standard factorization uv where v is its smallest proper suffix. For any Lyndon word v, we show that the set of Lyndon words having v as right factor of the standard factorization is regular and compute explicitly the associated generating function. Next, considering the Lyndon words of length n over a twoletter alphabet, we establish that, for the uniform distribution, the average length of the right factor v of the standard factorization is asymptotically 3n/4
Automates, énumération et algorithmes
Ces travaux s'inscrivent dans le cadre général de la théorie des automates, de la combinatoire des mots, de la combinatoire énumérative et de l'algorithmique. Ils ont en commun de traiter des automates et des langages réguliers, de problèmes d'énumération et de présenter des résultats constructifs, souvent explicitement sous forme d'algorithmes. Les domaines dont sont issus les problèmes abordés sont assez variés. Ce texte est compose de trois parties consacrées aux codes préfixes, à certaines séquences lexicographiques et à l'énumération d'automates