#2068 ⟨a, b | ababbbba=ab⟩

Quick links

Presentation has sum-of-sides 10
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by a is not injective:
- a ⋅ bab⁴a = ab and a ⋅ b = ab, however bab⁴a ≠ b
Enveloping group: ⟨a, b | aaaabb⟩

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 = abbbb
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.
Morphocompletion: how the auxiliary generators were found.

# ab:ababbbba=ab ac/b abbbb=c morph:5/0
cca=c
abca=ab
cb=abcc
abbca=abb
abbbca=abbb
abbbb=c

Up:	Monoids with two generators and one relation
Prev:	#2067 ⟨a, b \| ababbbba=aa⟩
Next:	#2069 ⟨a, b \| ababbbba=ba⟩