#861 ⟨a, b | abbabaab=a⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 9
- Infinite non-cancellative non-commutative monoid
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ b2aba2b = a and a ⋅ 1 = a, however b2aba2b ≠ 1
- Enveloping group: ⟨a, b | aabab-1b-1⟩
- Auxiliary generators:
- c = ababaa
- d = bbcb
- Reduction order:
- Right-to-left recursive path with deg(d) = deg(b) = 0, d < b; deg(c) = deg(a) = 1, c < a
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:abbabaab=a reversed:db/ca ababaa=c,bbcb=d morph:6/1,4/0
dcd=dddddbc
dbcd=dbddddbc
ddbbcd=dbddbc
dbdbbcd=bbc
dcb=dbddbddddbc
dbcb=bbcd
bbcb=d
a=cbb
ccd=cddddbc
cbcd=cbddddbc
cbbcd=cbbddddbc
cdbbcd=cbddbc
cbdbbcd=cbbddbc
cbbdbbcd=c
ccb=cbddbddddbc
cbcb=cbbddbddddbc