paper

Monoids admit finite complete rewriting systems

arXiv:1302.0982

Abstract

We prove that every monoid admits a finite complete rewriting system. Furthermore we prove that is non-hopfian, providing an example of a finitely presented non-residually finite monoid with linear Dehn function.

Monoids $\mathrm{Mon}\langle a,b:a^αb^βa^γb^δ=b\rangle$ admit finite complete rewriting systems · wovepaper