Abelian primitive words

Authors:
Michael Domaratzki;Narad Rampersad
Affiliations:
Department of Computer Science, University of Manitoba, Winnipeg, MB, Canada;Department of Mathematics, University of Liège, Liège, Belgium
Venue:
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Year:
2011

Citing 5
Cited 1

Algorithmic number theory

Algorithmic number theory
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
The Ambiguity of Primitive Words

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Formal Languages Consisting of Primitive Words

FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
On a special class of primitive words

Theoretical Computer Science

A note on efficient computation of all Abelian periods in a string

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. Also different from classical primitive words, we find that a word may have more than one Abelian root. We also consider enumeration of Abelian primitive words.