#2065 ⟨a, b | ababbaba=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 | aabab^-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 = bbbabaa
Reduction order:
- Left-to-right recursive path with deg(c) = 0; deg(b) = deg(a) = 1, b < a
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

# ab:ababbaba=ab c/ba bbbabaa=c morph:7/0
cb=cc
ab=ac
ccccaca=ccaccac
acccaca=acaccac
ccaccaca=cc
acaccaca=ac
bbbacaa=c

Up:	Monoids with two generators and one relation
Prev:	#2064 ⟨a, b \| ababbaba=aa⟩
Next:	#2066 ⟨a, b \| ababbaba=bb⟩