Monoids \mathrm{Mon}\langle a,b:a^{\alpha}b^{\beta}a^{\gamma}b^{\delta}a^{\varepsilon}b^{\varphi}=b\rangle admit finite complete rewriting systems

Publication date 12 February 2013

Free semigroups, generators and relations, word problems (20M05)

Abstract: The aim of this note is to prove that monoids

m a t h r m M o n l a n g l e a, b : a U b = b a n g l e

, with

a U b

of relative length 6, admit finite complete rewriting systems. This is some advance in the understanding the long-standing open problem whether the word problem for one-relator monoids is soluble.

This page was built for publication: Monoids $\mathrm{Mon}\langle a,b:a^{\alpha}b^{\beta}a^{\gamma}b^{\delta}a^{\varepsilon}b^{\varphi}=b\rangle$ admit finite complete rewriting systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239569)