1. Thierry Arnoux. Untersuchungen zum Makaninschen Algorithmus. Diplomarbeit 1613, Universität Stuttgart, 1998.
2. Christian Choffrut and Juhani Karhumäki. Combinatorics of words. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, pages 329–438. Springer-Verlag, Berlin, Heidelberg, New York, 1997.
3. Volker Diekert. Makanin’s Algorithm. In M. Lothaire: Algebraic Combinatorics on Words. Cambridge University Press. A preliminary version is on the web:
http://www-igm.univ-mlv.fr/
berstel/Lothaire/index.html.
4. Volker Diekert, Yuri Matiyasevich, and Anca Muscholl. Solving trace equations using lexicographical normal forms. In P. Degano et al., editors, Proc. 24th ICALP, Bologna (Italy) 1997, number 1256 in Lect. Notes Comp. Sci., pages 336–347. Springer-Verlag, Berlin, Heidelberg, New York, 1997.
5. Claudio Gutierrez. Satisfiability of word equations with constants is in exponential space. In Proc. 39th FOCS, pages 112–119, Los Alamitos, Californiax (USA), 1998. IEEE Computer Society Press.