#5786 ⟨a, b | aabbba=abaab⟩

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 ⋅ ab³a = aba²b and a ⋅ ba²b = aba²b, however ab³a ≠ ba²b
Enveloping group: ⟨a, b | aaaba^-1b^-1b^-1a^-1b⟩

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 = abaab
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:aabbba=abaab bc/a abaab=c magic:0
cbba=abc
caab=abac
cabbba=aabbbc
cbaab=aabbbc
aabbba=c
abaab=c

Up:	Monoids with two generators and one relation
Prev:	#5785 ⟨a, b \| aabbba=abaaa⟩
Next:	#5787 ⟨a, b \| aabbba=ababa⟩