#5872 ⟨a, b | ababab=abbba⟩

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 ⋅ b(ab)² = ab³a and a ⋅ b³a = ab³a, however b(ab)² ≠ b³a
Enveloping group: ⟨a, b | aabba^-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 = abbba
Reduction order:
- Left-to-right recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1
Certificate: derivations of all rewriting rules from the defining relations.

# ab:ababab=abbba ac/b abbba=c magic:0
cab=abc
cbba=ababc
abbba=c
ababab=c
cbbba=abbbc
cbabab=abbbc

Up:	Monoids with two generators and one relation
Prev:	#5871 ⟨a, b \| ababab=abbaa⟩
Next:	#5873 ⟨a, b \| ababab=baaaa⟩