1. Finite complete rewriting systems and the complexity of the word problem;Bauer;Tech. Rept. 103/84, Univ. Kaiserslautern, FB Informatik,1984
2. Thue systems and the Church-Rosser property: Replacement systems, specification of formal languages and presentations of monoids;Book,1983
3. Confluent reductions: Abstract properties and applications to term rewriting systems;Huet;J. Assoc. Comput. Mach.,1980
4. On a special monoid with a single defining relation;Jantzen;Theoret. Comput. Sci.,1981
5. Semi-Thue systems and generalized Church-Rosser properties;Jantzen,1982