1. S. I. Adian, “Upper bound on the derivational complexity in some word rewriting system,” Dokl. Ross. Akad. Nauk 428(3), 295–299 (2009) [Dokl. Math. 8 (2), 679–683 (2009)].
2. D. Hofbauer and J. Waldmann, “Termination of {aa → bc, bb → ac, cc → ab},” Inform. Process. Lett. 98(4), 156–158 (2006).
3. S. I. Adian, “Defining relations and algorithmic problems for groups and semigroups,” in Trudy Mat. Inst. Steklov (Nauka, Moscow, 1966), Vol. 85, pp. 3–123 [Proc. Steklov Inst. Math., Vol. 85, 3–152 (1966)].
4. S. I. Adian, The Burnside Problem and Identities in Groups (Nauka, Moscow, 1975) [in Russian].
5. H. Zantema, “Complexity of guided insertion-deletion in RNA-editing,” in Lecture Notes in Comput. Sci., Vol. 6031: Language and Automata Theory and Applications (Springer-Verlag, Berlin, 2010), pp. 608–619.