1. S.I. Adjan, Defining Relations and Algorithmic Problems for Groups and Semigroups.Proc. of the Steklov Institute of Mathematics, No. 85 (1966). Translated from the Russian by M. Greendlinger. American Mathematical Society, Providence, R.I. (1966).
2. Adjan S.I. and Oganesjan G.U., On the word and divisibility problems in semigroups with a single defining relation.Izvestiya: Mathematics12(1978) 207–212.
3. F. Baader and T. Nipkow, Term Rewriting and All That. Cambridge University Press, Cambridge (1998).
4. R.V. Book and F. Otto, String-rewriting systems.Texts and Monogr. Comput. Sci.Springer-Verlag, New York (1993).
5. J. Giesl, P. Schneider-Kamp and R. Thiemann, AProVE 1.2: automatic termination proofs in the dependency pair framework. InProc. of Automated reasoning. Vol. 4130 ofLect. Notes Comput. Sci.Springer, Berlin (2006) 281–286.