On abelian versions of critical factorization theorem
Sergey Avgustinovich, Juhani Karhumäki, Svetlana Puzynina (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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.