#5602 ⟨a, b | aaabba=aabab⟩

Quick links

Presentation has sum-of-sides 11
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by a is not injective:
- a ⋅ a²b²a = a(ab)² and a ⋅ (ab)² = a(ab)², however a²b²a ≠ (ab)²
Enveloping group: ⟨a, b | aaabb⟩

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 = aabab
Reduction order:
- Left-to-right recursive path with deg(a) = 0; deg(b) = deg(c) = 1, b < c
Certificate: derivations of all rewriting rules from the defining relations.

# ab:aaabba=aabab a/bc aabab=c magic:0
aabab=c
aaabba=c
cabab=aaabbc
caabba=aaabbc

Up:	Monoids with two generators and one relation
Prev:	#5601 ⟨a, b \| aaabba=aabaa⟩
Next:	#5603 ⟨a, b \| aaabba=aabba⟩