1. G. Bauer, F. Otto. Finite complete rewriting systems and the complexity of the word problem. Acta Inf. 21 (1984), 521–540.
2. R.V. Book. Thue systems as rewriting systems. Journal Symbolic Computation 3 (1987), 39–68.
3. R.V. Book, F. Otto. String-Rewriting Systems. Texts and Monographs in Computer Science (Springer, New York, 1993).
4. M. Jantzen. Confluent String Rewriting. EATCS Monographs on Theoretical Computer Science Vol. 14 (Springer, Berlin-Heidelberg, 1988).
5. D.E. Knuth, P. Bendix. Simple word problems in universal algebras. In: J. Leech (ed.): Computational Problems in Abstract Algebra (Pergamon, New York, 1970), 263–297.