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

Publication date 5 February 2013

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

Abstract: We prove that every monoid

admits a finite complete rewriting system. Furthermore we prove that

m a t h r m M o n l a n g l e a, b : a b^{2} a^{2} b^{2} = b a n g l e

is non-hopfian, providing an example of a finitely presented non-residually finite monoid with linear Dehn function.

This page was built for publication: Monoids $\mathrm{Mon}\langle a,b:a^{\alpha}b^{\beta}a^{\gamma}b^{\delta}=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 Q6239356)