ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER
From MaRDI portal
Publication:4039449
DOI10.1142/S021819679200013XzbMath0777.20024MaRDI QIDQ4039449
Publication date: 1 June 1993
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)
Related Items (11)
Decidability and independence of conjugacy problems in finitely presented monoids ⋮ On some algorithmic problems for groups and monoids ⋮ Unnamed Item ⋮ On the word problem for weakly compressible monoids ⋮ Normal subsemigroups of finite transformation semigroups ⋮ A new definition of conjugacy for semigroups ⋮ Unnamed Item ⋮ The word problem for one-relation monoids: a survey ⋮ Conjugacy in inverse semigroups ⋮ Conjugation in semigroups. ⋮ DECISION PROBLEMS FOR FINITELY PRESENTED AND ONE-RELATION SEMIGROUPS AND MONOIDS
This page was built for publication: ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER