#5799 ⟨a, b | aabbba=babba⟩

Quick links

Presentation has sum-of-sides 11
Infinite non-cancellative non-commutative monoid
Not right cancellative, because right multiplication by a is not injective:
- a²b³ ⋅ a = bab²a and bab² ⋅ a = bab²a, however a²b³ ≠ 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 = babba
Reduction order:
- Left-to-right recursive path with deg(a) = 0; deg(c) = deg(b) = 1, c < b
Certificate: derivations of all rewriting rules from the defining relations.

# ab:aabbba=babba a/cb babba=c magic:0
babc=cbba
aabbc=cbba
babba=c
aabbba=c
babbc=cabbba
aabbbc=cabbba

Up:	Monoids with two generators and one relation
Prev:	#5798 ⟨a, b \| aabbba=babab⟩
Next:	#5800 ⟨a, b \| aabbba=babbb⟩