1. S. Adjan, Defining relations and algorithmic problems for groups and semigroups, Proc. Steklov Inst. Math. 85, 1966. (English version published by the American Mathematical Society, 1967.)
2. J. Avenhaus, R. Book, and C. Squier, On expressing commutativity by Church-Rosser presentations: a note on commutative monoids, R.A.I.R.O. Informatique Théorique 18 (1984), 47–52.
3. J. Avenhaus and K. Madlener, Algorithmische probleme bei einrelatorgruppen und ihre komplexität, Arch. Math. Logic 19 (1978), 3–12.
4. J. Avenhaus, K. Madlener, and F. Otto, Groups presented by finite two-monadic Church-Rosser Thue systems, Interner Bericht, Fachbereich Informatik, Univ. Kaiserslautern, 1984.
5. G. Bauer, Zur Darstellung von Monoiden durch Regelsysteme, Dissertation, Univ. Kaiserslautern, 1984.