#5657 ⟨a, b | aabaab=abbaa⟩
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 = ab2a2 and a ⋅ b2a2 = ab2a2, however aba2b ≠ b2a2
- Enveloping group: ⟨a, b | aabab-1b-1a-1a-1b⟩
- Auxiliary generators:
- c = aaba
- d = ab
- e = db
- Reduction order:
- Right-to-left recursive path with deg(e) = 0; deg(c) = deg(a) = deg(d) = 1, c < a < d; deg(b) = 2
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aabaab=abbaa reversed:e/cad/b aaba=c,ab=d,db=e morph:4/0,2/0,2/0
cea=ec
eeaa=cce
cd=eaa
ead=ce
eaaa=adc
ada=c
cadc=ecaa
ecaaea=cadec
cceda=eeac
cadeaa=ecaad
cadecaa=ecaaadc
ecaaceda=cadeeac
ecaadda=cadeac
cb=add
ceb=eae
ab=d
db=e
ecaaeb=cadeae