#2593 ⟨a, b | ababab=abaa⟩

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 ⋅ b(ab)² = aba² and a ⋅ ba² = aba², however b(ab)² ≠ ba²
Enveloping group: ⟨a, b | aabb⟩

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

# ab:ababab=abaa bc/a abaa=c magic:0
cab=abc
caa=ababc
cbaa=abac
cbabab=abac
abaa=c
ababab=c

Up:	Monoids with two generators and one relation
Prev:	#2592 ⟨a, b \| ababab=aabb⟩
Next:	#2594 ⟨a, b \| ababab=abab⟩