#1269 ⟨a, b | abbba=abab⟩

Quick links

Presentation has sum-of-sides 9
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by a is not injective:
- a ⋅ b³a = (ab)² and a ⋅ bab = (ab)², however b³a ≠ bab
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 = abab
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:abbba=abab bc/a abab=c magic:0
cab=abc
cbab=abbbc
cbba=abc
cbbba=abbbc
abab=c
abbba=c

Up:	Monoids with two generators and one relation
Prev:	#1268 ⟨a, b \| abbba=aabb⟩
Next:	#1270 ⟨a, b \| abbba=abba⟩