1. I.J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60:1–82, 1988.
2. Michael Bertol. Mustererkennungsprobleme auf frei partiell kommutativen Monoiden und deren algorithmische Lösung. Diplomarbeit, Universität Stuttgart, 1993.
3. R.V. Book and F. Otto. String Rewriting Systems. Texts and Monographs in Computer Science. Springer Verlag, New York, 1993.
4. P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements. Number 85 in Lecture Notes in Mathematics. Springer, Berlin-Heidelberg-New York, 1969.
5. M. Clerblout, M. Latteux, Y. Roos, and W. Zielonka. Semi-commutations and rational expressions. In Werner Kuich, editor, Proceedings of the 19th International Colloquium on Automata Languages and Programming (ICALP'92), Vienna (Austria) 1992, volume 623 of Lecture Notes in Computer Science, pages 113–125, Berlin-Heidelberg-New York, 1992. Springer.