A short proof of a theorem of Adjan
HTML articles powered by AMS MathViewer
- by Louxin Zhang PDF
- Proc. Amer. Math. Soc. 116 (1992), 1-3 Request permission
Abstract:
In this note, using the technique of rewriting, we give a short proof of a theorem of Adjan: the word problem is decidable for special one-relator monoids $(A;w = e)$.References
- S. I. Adjan, Defining relations and algorithmic problems for groups and semigroups, Trudy Mat. Inst. Steklov. 85 (1966), 123 (Russian). MR 0204501
- W. Magnus, Das Identitätsproblem für Gruppen mit einer definierenden Relation, Math. Ann. 106 (1932), no. 1, 295–307 (German). MR 1512760, DOI 10.1007/BF01455888 W. Magnus, A. Karrass, and D. Solitar, Combinatorial group theory, Wiley, New York, 1966.
- R. McNaughton and P. Narendran, Special monoids and special Thue systems, J. Algebra 108 (1987), no. 1, 248–255. MR 887206, DOI 10.1016/0021-8693(87)90136-0
Additional Information
- © Copyright 1992 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 116 (1992), 1-3
- MSC: Primary 20M05; Secondary 03B25, 03D40
- DOI: https://doi.org/10.1090/S0002-9939-1992-1092933-6
- MathSciNet review: 1092933