#2458 ⟨a, b | aaabba=abab⟩

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 ⋅ a²b²a = (ab)² and a ⋅ bab = (ab)², however a²b²a ≠ bab
Enveloping group: ⟨a, b | aabab^-1abb⟩

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 = abab
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=abab a/bc abab=c magic:0
abab=c
aaabba=c
cab=abc
cbab=aaabbc
caabba=aaabbc

Up:	Monoids with two generators and one relation
Prev:	#2457 ⟨a, b \| aaabba=abaa⟩
Next:	#2459 ⟨a, b \| aaabba=abba⟩