Preview
Unable to display preview. Download preview PDF.
References
ADYAN, S.I., Defining relations and algorithmic problems for groups and seimtroups, Tr. Mat. Inst. Akad. Nauk SSSR 85 (1966), 1–124.
ADYAN, S.I., On transformations of words in semigroups presented by a system of defining relations, Alg. i Log. 15, 6 (1976), 611–621.
ADYAN S.I. and OGANESYAN, G.U., On the problems of equality and divisibility in semigroups with a single defining relation, Izv. Akad. Nauk SSSR, Ser. Mat. 42, 2 (1978), 219–225.
ADYAN, S.I. and OGANESYAN, G.U., Problems of equality and divisibility in semigroups with a single defining relation, Mat. Zam. 41, 3 (1987), 412–421.
EVANS, T., On multiplicative systems defined by generators andrelations, I. Normal form theorems, Proc. Camb. Phil. Soc. 47 (1951), 637–649.
OGANESYAN, G.U., The solvability of the word problem for semigroups with a defining relation of the form A=BtC, Izv. Akad. Nauk Armjan SSSR, Ser. Mat. 14, 4 (1979), 288–291, 315 MR # 81g: 20106.
OGANESYAN, G.U., On semigroups with a single defining relation and semigroups without cycles, Izv. Akad. Nauk SSSR, Ser. Mat. 46, 1 (1982), 84–94.
PEDERSEN, J., The word problem in absorbing varieties, Houston J. Math. 11, 4 (1985), 575–590.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pedersen, J. (1989). Morphocompletion for one-relation monoids. In: Dershowitz, N. (eds) Rewriting Techniques and Applications. RTA 1989. Lecture Notes in Computer Science, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51081-8_141
Download citation
DOI: https://doi.org/10.1007/3-540-51081-8_141
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51081-9
Online ISBN: 978-3-540-46149-4
eBook Packages: Springer Book Archive