#891 ⟨a, b | aaaabba=ab⟩

Quick links

Presentation has sum-of-sides 9
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 | aaabab^-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 = abb
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:aaaabba=ab reversed:ac/b abb=c morph:3/0
aaacc=caaca
aaacaaaca=c
ab=aaaca
cb=caaca

Up:	Monoids with two generators and one relation
Prev:	#890 ⟨a, b \| aaaabba=aa⟩
Next:	#892 ⟨a, b \| aaaabba=ba⟩