#5651 ⟨a, b | aabaab=aabba⟩

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 ⋅ aba²b = a²b²a and a ⋅ ab²a = a²b²a, however aba²b ≠ ab²a
Enveloping group: ⟨a, b | aaba^-1b^-1⟩

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 = aabba
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:aabaab=aabba a/bc aabba=c magic:0
aabba=c
aabaab=c
cba=aabc
caab=aabc
cabba=aabbc
cabaab=aabbc

Up:	Monoids with two generators and one relation
Prev:	#5650 ⟨a, b \| aabaab=aabab⟩
Next:	#5652 ⟨a, b \| aabaab=aabbb⟩