1. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)
2. Ceĭtin, G.C.: Associative calculus with an unsolvable equivalence problem. Tr. Mat. Inst. Akad. Nauk 52, 172–189 (1958) (Russian)
3. Karhumäki, J., Saarela, A.: Noneffective regularity of equality languages and bounded delay morphisms. Discret. Math. Theor. Comput. Sci. 12(4), 9–18 (2010)
4. Lecerf, M.Y.: Récursive insolubilité de l’équation générale de diagonalisation de deux monomorphismes de monoïdes libres φx=ψx. C. R. 257, 2940–2943 (1963)
5. Makanin, G.S.: The identity problem in finitely defined semigroups. Dokl. Akad. Nauk SSSR 107(2), 285–287 (1966). Sov. Math. Dokl, 7(6):1478–1480 (1966)