References
Adjan, S. I.,Defining relations and algorithmic problems for groups and semigroups, Tr. Mat. Inst. Steklov85 (1966), 1–124 (Russian); Am. Math. Soc. Transl.152, 1967.
Adjan, S. I.,Transformation of words in a semigroup presented by a system of defining relations, Algebra i Logica15 (1977) no 6, 611–621 (Russian).
Adjan, S. I. and G. U. Oganesyan,On the problems of equality and divisibility in semigroups with one defining relation, Izv. Akad. Nauk SSSR, Ser. Mat.42 (1978) no 2, 219–225 (Russian).
Eilenberg, S., “Automata, Languages and Machines”, Volume A, Academic Press, 1974.
Evans, T.,Some connections between residual finiteness, finite embeddability and the word problem, J. London Math. Soc. (2)1 (1969), 399–403.
Lallement, G., “Semigroups and Combinatorial Applications”, Interscience, John Wiley and Sons, 1979.
Perrin, D. and P. Schupp,Sur les monoïdes à un relateur qui sont des groupes, Th. Comp. Sc.33 (1984), 331–334.
Author information
Authors and Affiliations
Additional information
Communicated by Dominique Perrin
Rights and permissions
About this article
Cite this article
Lallement, G., Rosaz, L. Residual finiteness of a class of semigroups presented by a single relation. Semigroup Forum 48, 169–179 (1994). https://doi.org/10.1007/BF02573667
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02573667