#5655 ⟨a, b | aabaab=ababa⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 11
- Infinite non-cancellative non-commutative monoid
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ aba2b = a(ba)2 and a ⋅ (ba)2 = a(ba)2, however aba2b ≠ (ba)2
- Enveloping group: ⟨a, b | aabba-1b-1⟩
- Auxiliary generators:
- c = ab
- d = cccc
- Reduction order:
- Left-to-right recursive path with deg(a) = deg(d) = 0, a < d; deg(c) = deg(b) = 1, c < b
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aabaab=ababa ad/cb ab=c,cccc=d morph:2/0,4/0
dc=cd
daac=acada
ab=c
acac=cca
dacc=acaacad
daaacb=acaacaad
accca=ccaac
daaaccac=acaacaacda
dacaacb=ccacaad
cccc=d
dacaaccac=ccacaacda
ccaacb=ad
ccaccc=acad
ccaaccac=acda
ccacaacb=acaad
ccacaaccac=acaacda