#5277 ⟨a, b | aabbbba=bbaa⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 11
- Infinite non-commutative monoid
- Reduction order:
- Right-to-left recursive path with deg(a) = deg(e) = deg(d) = 0, a < e < d; deg(c) = deg(b) = 1, c < b
- Auxiliary generators:
- bbbb=c
- caa=d
- aca=e
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aabbbba=bbaa reversed:aed/cb bbbb=c,caa=d,aca=e morph:4/0,3/0,3/0
ad=ea
aed=da
aca=e
aeca=d
ace=eca
aece=dca
cd=dce
caa=d
cea=deca
cae=dca
cee=dece
ced=dedce
cb=bc
bbd=dca
bbaa=ae
bbea=aeeca
bbae=d
bbee=aeece
bbed=aeedce
bbbb=c