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
From MaRDI portal
Publication:6239569
arXiv1302.2819MaRDI QIDQ6239569FDOQ6239569
Authors: Alan J. Cain, Victor Maltcev 
Publication date: 12 February 2013
Abstract: The aim of this note is to prove that monoids , with 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)
