#5936 ⟨a, b | abbbba=abbab⟩

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⁴a = ab²ab and a ⋅ b²ab = ab²ab, however b⁴a ≠ b²ab
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 = abbab
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:abbbba=abbab bc/a abbab=c magic:0
cbab=abbc
cbbab=abbbbc
cbbba=abbc
cbbbba=abbbbc
abbab=c
abbbba=c

Up:	Monoids with two generators and one relation
Prev:	#5935 ⟨a, b \| abbbba=ababb⟩
Next:	#5937 ⟨a, b \| abbbba=abbba⟩