1. Adjan, S., Defining Relations and Algorithmic Problems for Groups and Semigroups, Proc. Steklov Inst. Math. 85, (1966) (English version published by the American Mathematical Society, 1967.)
2. Avenhaus, J., Book, R., and Sqier, C., On Expressing Communtativity Monoids, R.A.I.R.O. Informatique Théorique, to appear.
3. Avenhaus, J., and Madlener, K., Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität, Arch. math. Logic 19, (1978), 3–12.
4. Avenhaus, J., and Madlener, K., String Matching and Algorithmic Problems in Free Groups, Revista Columbiana de Mathematicas 14, 1–16 (1980).
5. Berstel, J., Congruences plus que parfaites et langages algébriques, Séminaire d'Informatique Théorique, Institute de Programmation, (1976–77), 123–147.