1. S.I. Adjan, Defining relations and algorithmic problems for groups and semigroups, in Proceeding of the Steklovinstitute of Mathematics 85, American Mathematical Society, Providence, 1966.
2. G. Bauer and F. Otto, Finite complete rewriting systems and the com-plexity of the word problem, Acta Inform., 21 (1984), 521–540.
3. R.V. Book, Decidable sentences of Church—Rosser congruences, The-oret. Comput. Sci., 24 (1983), 301–312.
4. R.V. Book, M. Jantzen, and C. Wrathall, Monadic Thue systems, Theoret. Comput. Sci., 19 (1982), 231–251.
5. R.V. Book and F. Otto, String-Rewriting Systems, Springer-Verlag, New York, 1993.