RAIRO-Theor. Inf. Appl.
Volume 46, Number 1, January-March 2012Special issue dedicated to the 13th "Journées Montoises d'Informatique Théorique"
|Page(s)||3 - 15|
|Published online||22 September 2011|
On abelian versions of critical factorization theorem∗
1 Sobolev Institute of Mathematics, 630090 Novosibirsk, Russia
2 University of Turku, Department of Mathematics, 20014 Turku, Finland
3 Turku Centre for Computer Science, 20014 Turku, Finland
Received: 2 November 2010
Accepted: 2 August 2011
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.
Mathematics Subject Classification: 68R15
Key words: Combinatorics on words / periodicity / central factorization theorem / abelian properties of words.
© EDP Sciences 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.