References
- Benninghofen , B. , Kemmerich , S. and Richter , M. M. 1987 . Lecture Notes in Computer Science . Systems of Reductions , 277
- Cohen , D. E. 1993 . String rewriting a survey for group theorists . Geometric Group Theory , 1 : 37 – 47 .
- Dekov , D. V. 1993 . Free products with amalgamation of monoids . J. Pure Appl. Algebra , 1
- Dershowitz , N. 1982 . Orderings for term-rewriting systems . Theoret. Comput. Sci , 17 : 279 – 301 .
- Dershowitz , N. 1992 . Rewriting methods for word problems . Words, Languages and Combinatorics , 17 : 104 – 118 .
- Greendlinger , M. 1960 . Dehn's algorithm for the word problem . Comm. Pure Appl. Math. , 13 : 67 – 83 .
- Hermiller , S. M. 1992 . Rewriting Systems for Coxeter Groups , Ph. D. Thesis .
- Hermiller , S. M. 1994 . Rewriting systems for Coxeter groups . J. Pure Appl. Algebra , 92 : 137 – 148 .
- Howie , J. M. 1976 . An Introduction to Semigroup Theory , London : Academic Press .
- Kosniowski , C. 1980 . A First Course in Algebraic Topology , Cambridge University Press .
- Lankford , D. S. 1977 . Some approaches to equality for computational logic: A survey and assessmentSome approaches to equality for computational logic: A survey and assessment , University of Texas .
- Ph , Chenadec . 1986 . Canonical Forms in Finitely Presented Algebras , New York : Pitman and Wiley .
- Ph , Le Chenadec . 1986 . A catalogue of complete group presentations . J. Symbolic Comput. , 2 : 363 – 381 .
- M. H. A , Newman . 1942 . On theories with a combinatorial definition of equivalence . Ann. of Math. , 43 : 223 – 243 .
- Martin , U. 1993 . On the diversity of orderings on strings , Scotland : University of St. Andrews .
- Otto , F. 1984 . Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group . Theoret. Comput. Sci. , 32 : 249 – 260 .
- Pedersen , J. and Yoder , M. 1994 . Term rewriting for the conjugacy problem and the braid groups . J. Symbolic Comput. , 18 : 563 – 572 .