ABELIAN PRIMITIVE WORDS
Michael Domaratzki, Narad Rampersad · International Journal of Foundations of Computer Science · 2012
We investigate Abelian primitive words, which are words that are not Abelian powers. We show the set of Abelian primitive words is not context-free. We can determine whether a word is Abelian primitive in linear time (for fixed alphabet size). Also differently from classical primitive words, we find that a word may have more than one Abelian root. We also consider enumeration of Abelian primitive words.