#2500 ⟨a, b | aababa=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(ba)² = (ab)² and a ⋅ bab = (ab)², however a(ba)² ≠ bab
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 = abab
Reduction order:
- Right-to-left recursive path with deg(a) = 0; deg(c) = deg(b) = 1, c < b
Certificate: derivations of all rewriting rules from the defining relations.

# ab:aababa=abab reversed:a/cb abab=c magic:0
aca=c
cca=acc
cb=aabc
cab=abc
abab=c

Up:	Monoids with two generators and one relation
Prev:	#2499 ⟨a, b \| aababa=abaa⟩
Next:	#2501 ⟨a, b \| aababa=abba⟩