C. Choffrut and J. Karhumäki, Combinatorics of Words, Handbook of Formal Languages, pp.329-438, 1997.
DOI : 10.1007/978-3-642-59136-5_6

T. Harju and J. Karhumäki, On the defect theorem and simplifiability, Semigroup Forum 33, pp.199-217, 1986.

J. Karhumäki, J. Ma?uch, and W. Plandowski, On defect effect of bi-infinite words, MFCS'98, pp.674-682, 1998.
DOI : 10.1007/BFb0055818

J. Karhumäki, J. Ma?uch, and W. Plandowski, A defect theorem for bi-infinite words, Theoretical Computer Science, vol.292, issue.1
DOI : 10.1016/S0304-3975(01)00225-0

M. Lothaire, Combinatorics on words, Encyclopedia of Mathematics and its Applications, vol.17, 1983.
DOI : 10.1017/CBO9780511566097
URL : https://hal.archives-ouvertes.fr/hal-00620607

E. Le-rest, L. Rest, and M. , Sur la combinatoire des codes ?? deux mots, Theoretical Computer Science, vol.41, pp.61-80, 1985.
DOI : 10.1016/0304-3975(85)90060-X

A. Lentin and M. P. Schützenberger, A combinatorial problem in the theory of free monoids, Combinatorial Mathematics and its Applications, pp.128-144, 1969.

R. C. Lyndon and M. P. Schützenberger, The equation a m = b n c p in a free group, pp.289-298, 1962.