E. M. Bullock, Improved bounds on the length of maximal abelian square-free words, Electron, J. Combin, vol.11, p.17, 2004.

A. Carpi, On the number of Abelian square-free words on four letters, Discrete Applied Mathematics, vol.81, issue.1-3, pp.155-167, 1998.
DOI : 10.1016/S0166-218X(97)88002-X

L. J. Cummings and M. Mays, A one-sided Zimin construction, Electron. J. Combin, vol.8, p.27, 2001.

P. Erd?-os, Some unsolved problems, Magyar Tud, Akad. Mat. Kutató Int. Közl, vol.6, pp.221-254, 1961.

A. A. Evdokimov, Strongly asymmetric sequences generated by a finite number of symbols, Dokl. Akad. Nauk SSSR Soviet Math. Dokl, vol.179, issue.9, pp.1268-1271, 1968.

A. Evdokimov and S. Kitaev, Crucial words and the complexity of some extremal problems for sets of prohibited words, Journal of Combinatorial Theory, Series A, vol.105, issue.2, pp.273-289, 2004.
DOI : 10.1016/j.jcta.2003.12.003

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

M. Korn, Maximal abelian square-free words of short length, Journal of Combinatorial Theory, Series A, vol.102, issue.1, pp.207-211, 2003.
DOI : 10.1016/S0097-3165(03)00016-5

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

A. Zimin, BLOCKING SETS OF TERMS, Mathematics of the USSR-Sbornik, vol.47, issue.2, pp.363-375, 1982.
DOI : 10.1070/SM1984v047n02ABEH002647