#1932 ⟨a, b | aaabbbba=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 ⋅ a²b⁴a = ab and a ⋅ b = ab, however a²b⁴a ≠ b
Enveloping group: ⟨a, b | aaaabba^-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 = bbbba
Reduction order:
- Right-to-left 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:aaabbbba=ab reversed:ac/b bbbba=c morph:5/0
aaacc=acaca
caacc=ccaca
aaacaacaacaaca=ac
caacaacaacaaca=cc
ab=aaac
cb=caac
bbbba=c

Up:	Monoids with two generators and one relation
Prev:	#1931 ⟨a, b \| aaabbbba=aa⟩
Next:	#1933 ⟨a, b \| aaabbbba=ba⟩