#1763 ⟨a, b | abaabaaab=a⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 10
- Infinite non-cancellative non-commutative monoid
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ ba2ba3b = a and a ⋅ 1 = a, however ba2ba3b ≠ 1
- Enveloping group: ⟨a, b | aabab-1b-1⟩
- Auxiliary generators:
- c = abaab
- d = aaa
- e = cca
- Reduction order:
- Right-to-left recursive path with deg(c) = 0; deg(e) = 1; deg(d) = deg(a) = deg(b) = 2, d < a < b
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:abaabaaab=a reversed:c/e/dab abaab=c,aaa=d,cca=e morph:5/0,3/0,3/0
dc=eccd
de=ecceed
cca=e
eac=a
cceae=eca
cceeae=ea
eeeae=ccd
eceeaec=ccccd
eceeaee=cccceed
da=ad
aa=eeae
aca=eae
eeaea=d
aeae=eeaeca
aceae=eaeca
aeeae=d
aceeae=eaea
db=ceeaec
ceab=ebac
ceceeaeb=ebeaec
abac=ceeaeb
abae=ceeaebca
abeae=ceeaeba
eabeeaec=cabccd
ceeaebeeaec=abccd
eabceeaec=cabeeae
ceeaebceeaec=abeeae
eabeeaee=cabcceed
ceeaebeeaee=abcceed
eceeaebceeaee=cabed
aeab=eaebac
aeceeaeb=eaebeaec
ebeeaeb=ccc
abeeaeca=ceeaebceeaee
abeeaeceae=ceeaebceeaeeca
abeeaeceeae=ceeaebceeaeea
abeeaeb=c
abeeaeeab=ceeaebceeaeebac
eabceeaeeab=cabceeaecac
ceeaebceeaeeab=abceeaecac
abeeaeeceeaeb=ceeaebceeaeebeaec
eabceeaeeceeaeb=cabceeaeceaec
ceeaebceeaeeceeaeb=abceeaeceaec