S. V. Avgustinovich, A. Glen, B. V. Halldórsson, and S. Kitaev, On shortest crucial words avoiding abelian powers, Discrete Applied Mathematics, vol.158, issue.6, pp.605-607, 2010.
DOI : 10.1016/j.dam.2009.11.010
URL : https://doi.org/10.1016/j.dam.2009.11.010

F. Blanchet-sadri, J. I. Kim, R. Mercas, W. Severa, and S. Simmons, Abelian Square-Free Partial Words, Lecture Notes in Computer Science, vol.6031, pp.94-105, 2010.
DOI : 10.1007/978-3-642-13089-2_8

F. Blanchet-sadri and S. Simmons, Avoiding Abelian Powers in Partial Words, pp.70-81
DOI : 10.1017/S0305004100046077

J. Cassaigne, G. Richomme, K. Saari, and L. Q. Zamboni, AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY, International Journal of Foundations of Computer Science, vol.27, issue.04, pp.905-920, 2011.
DOI : 10.1016/j.tcs.2007.10.027
URL : https://hal.archives-ouvertes.fr/lirmm-00601553

F. Cicalese, G. Fici, and Z. Lipták, Searching for jumbled patterns in strings, Proceedings of the Prague Stringology Conference, pp.105-117, 2009.

S. Constantinescu and L. Ilie, Fine and Wilf's theorem for Abelian periods, Bulletin of the EATCS, vol.89, pp.167-170, 2006.

L. J. Cummings and W. F. Smyth, Weak repetitions in strings, J. Combinatorial Math. and Combinatorial Computing, vol.24, pp.33-48, 1997.

J. D. Currie and A. Aberkane, A cyclic binary morphism avoiding Abelian fourth powers, Theoretical Computer Science, vol.410, issue.1, pp.44-52, 2009.
DOI : 10.1016/j.tcs.2008.09.027
URL : https://doi.org/10.1016/j.tcs.2008.09.027

J. D. Currie and T. I. Visentin, Long binary patterns are Abelian 2-avoidable, Theoretical Computer Science, vol.409, issue.3, pp.432-437, 2008.
DOI : 10.1016/j.tcs.2008.08.039
URL : https://doi.org/10.1016/j.tcs.2008.08.039

M. Domaratzki and N. Rampersad, Abelian primitive words, Mauri and Leporati, pp.204-215
DOI : 10.1007/978-3-642-22321-1_18

P. Erdös, Some unsolved problems., The Michigan Mathematical Journal, vol.4, issue.3, pp.221-254, 1961.
DOI : 10.1307/mmj/1028997963

G. Fici, T. Lecroq, A. Lefebvre, and É. Prieur-gaston, Computing Abelian periods in words, Proceedings of the Prague Stringology Conference 2011, pp.184-196, 2011.
DOI : 10.1016/j.dam.2013.08.021
URL : https://hal.archives-ouvertes.fr/hal-00627216

V. Keränen, Abelian squares are avoidable on 4 letters, Lecture Notes in Computer Science, vol.623, pp.41-52, 1992.
DOI : 10.1007/3-540-55719-9_62

T. M. Moosa and M. S. Rahman, Indexing permutations for binary strings, Information Processing Letters, vol.110, issue.18-19, pp.18-19795, 2010.
DOI : 10.1016/j.ipl.2010.06.012

P. A. Pleasants, Non-repetitive sequences, Proc. Cambridge Phil. Soc, pp.267-274, 1970.
DOI : 10.2307/3610126