1. J. Berstel,Transductions and Context-Free Languages. Teubner Verlag (1979).
2. M. Clerbout and Y. Roos, Semi-commutations and algebraic languages, inSTACS 90, in vol. 415, edited by Christian Choffrut and Thomas Lengauer.Lect. Notes Comput. Sci.Springer Berlin/Heidelberg (1990) 82–94.
3. N. Dershowitz, Open. closed. open, in vol. 3467 ofLect. Notes Comput. Sci. RTA, edited by J. Giesl. Springer (2005) 376–393.
4. S. Eilenberg and B. Tilson, Automata, languages and machines, vol. B,Pure Appl. Math.Academic Press, New York, San Francisco, London (1976).
5. A. Geser, Termination of string rewriting rules that have one pair of overlaps, in vol. 2706,Lect. Notes Comput. Sci. RTA, edited by R. Nieuwenhuis. Springer (2003) 410–423.