DOI

In the paper we study abelian versions of the critical factorization theorem. We investigate both similarities and differences between the abelian powers and the usual powers. The results we obtained show that the constraints for abelian powers implying periodicity should be quite strong, but still natural analogies exist.

Original languageEnglish
Pages (from-to)3-15
Number of pages13
JournalRAIRO - Theoretical Informatics and Applications
Volume46
Issue number1
DOIs
StatePublished - 1 Jan 2012

    Research areas

  • Abelian properties of words, Central factorization theorem, Combinatorics on words, Periodicity

    Scopus subject areas

  • Mathematics(all)
  • Software
  • Computer Science Applications

ID: 41131063