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

preprint2013arXivOpen access

Abstract

We prove that every monoid Mon⟨a,b:aαbβaγbδ=b⟩\mathrm{Mon}\langle a,b:a^αb^βa^γb^δ=b\rangle admits a finite complete rewriting system. Furthermore we prove that Mon⟨a,b:ab2a2b2=b⟩\mathrm{Mon}\langle a,b:ab^2a^2b^2=b\rangle is non-hopfian, providing an example of a finitely presented non-residually finite monoid with linear Dehn function.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.