⟨ Slava's | Monoid Zoo ⟩

Finite complete rewriting systems for short monoid presentations

⇒ This web site exhibits finite complete rewriting systems for finitely-presented monoids with varying numbers of generators and relations, in order of increasing presentation length. Learn more…

Monoids with two generators and one relation:

Monoids with two generators and two relations:

Monoids with three generators and two relations: