#5788 ⟨a, b | aabbba=ababb⟩

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 ⋅ ab³a = abab² and a ⋅ bab² = abab², however ab³a ≠ bab²
Enveloping group: ⟨a, b | aabab^-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 = ababb
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:aabbba=ababb a/bc ababb=c magic:0
ababb=c
aabbba=c
cbabb=aabbbc
cabbba=aabbbc

Up:	Monoids with two generators and one relation
Prev:	#5787 ⟨a, b \| aabbba=ababa⟩
Next:	#5789 ⟨a, b \| aabbba=abbaa⟩