1. A. V. Aho, J. E. Hopcroft and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, M.A., 1974.
2. M. Bertol. Efficient rewriting in cograph trace monoids. In Proceedings of the Fundamentals of Computation Theory (FCT '95), Dresden (Germany) 1995, Lecture Notes in Computer Science, Berlin-Heidelberg-New York, 1995. Springer.
3. M. Bertol and V. Diekert. On efficient reduction-algorithms for some trace rewriting systems. In H. Common and J.-P. Jouannaud, editors, Proceedings of the Term Rewriting., number 909 in Lecture Notes in Computer Science, pages 114–126, Berlin-Heidelberg-New York, 1993. Springer.
4. R. Book. Confluent and other types of Thue systems. J. Assoc. Comput. Mach., 29:171–182, 1982.
5. R.V. Book and F. Otto. String Rewriting Systems. Texts and Monographs in Computer Science. Springer Verlag, New York, 1993.