#5610 ⟨a, b | aaabba=abbab⟩

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 ⋅ a²b²a = ab²ab and a ⋅ b²ab = ab²ab, however a²b²a ≠ b²ab
Enveloping group: ⟨a, b | aabaabbab^-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(c) = deg(a) = 0, c < a; deg(b) = 1
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

# ab:aaabba=abbab reversed:ca/b abb=c morph:3/1
aaaaca=cc
ccaaaca=aaaaccc
ccb=aacc
cab=aaca
abb=c

Up:	Monoids with two generators and one relation
Prev:	#5609 ⟨a, b \| aaabba=abbaa⟩
Next:	#5611 ⟨a, b \| aaabba=abbba⟩