#1970 ⟨a, b | aababbaa=ab⟩

Quick links

Presentation has sum-of-sides 10
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by a is not injective:
- a ⋅ abab²a² = ab and a ⋅ b = ab, however abab²a² ≠ b
Enveloping group: ⟨a, b | aababa^-1bb⟩

Format:	Pretty Plain
Word to reduce:
	Tips: Lowercase letters stand for generators. Spaces are ignored. Numbers repeat the previous letter, e.g. `b90`.
Reduction strategy:	Leftmost Rightmost
Path to normal form:	1 1

Auxiliary generators:
1. c = ab
Reduction order:
- Left-to-right recursive path with deg(c) = 0; deg(a) = deg(b) = 1, a < b
Certificate: derivations of all rewriting rules from the defining relations.

# ab:aababbaa=ab c/ab ab=c magic:0
ab=c
cbb=cccbac
accbac=cb
cccbaa=cb
cbcbac=accbcb
cbccbac=cccbacb
accbaa=c
cbcbaa=accbc
cbccbaa=cccbac

Up:	Monoids with two generators and one relation
Prev:	#1969 ⟨a, b \| aababbaa=aa⟩
Next:	#1971 ⟨a, b \| aababbaa=ba⟩