1. R. V. Book and F. Otto. String-Rewriting Sytsems. Springer-Verlag, 1993.
2. Hans Bücken. Reduction-systems and small cancellation theory. In Proceedings of 4th Workshop on Automated Deduction, pages 53–59, 1979.
3. N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244–320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI.
4. D. B. A. Epstein, D. F. Holt, and S. Rees. The use of knuth-bendix methods to solve the word problem in authomatic groups. Journal of Symbolic Computation, 12:397–414, 1991.
5. D. Fortin, C. Kirchner, and P. Strogova. Routing in Regular Networks Using Rewriting. In J. Slaney, editor, Proceedings of the CADE international workshop on automated reasoning in algebra (ARIA), pages 5–8, June 1994.