#5886 ⟨a, b | ababba=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 ⋅ bab²a = aba²b and a ⋅ ba²b = aba²b, however bab²a ≠ ba²b
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 = 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:ababba=abaab bc/a abaab=c magic:0
caab=abac
cabba=abac
cbaab=ababbc
cbabba=ababbc
abaab=c
ababba=c

Up:	Monoids with two generators and one relation
Prev:	#5885 ⟨a, b \| ababba=abaaa⟩
Next:	#5887 ⟨a, b \| ababba=ababa⟩