Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-06-21
Computer Science
Formal Languages and Automata Theory
Scientific paper
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.
Domaratzki Michael
Rampersad Narad
No associations
LandOfFree
Abelian Primitive Words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Abelian Primitive Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abelian Primitive Words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-601877