#2606 ⟨a, b | ababba=abbb⟩

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 ⋅ bab²a = ab³ and a ⋅ b³ = ab³, however bab²a ≠ b³
Enveloping group: ⟨a, b | aaaabb⟩

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

# ab:ababba=abbb ac/b abbb=c magic:0
abbb=c
ababba=c
cbbb=ababbc
cbabba=ababbc

Up:	Monoids with two generators and one relation
Prev:	#2605 ⟨a, b \| ababba=abba⟩
Next:	#2607 ⟨a, b \| ababba=baaa⟩