#4865 ⟨a, b | abbaabba=bab⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 11
- Infinite non-commutative monoid
- Reduction order:
- Left-to-right recursive path with deg(h) = 0; deg(e) = deg(f) = deg(b) = deg(c) = deg(g) = deg(d) = deg(a) = 1, e < f < b < c < g < d < a
- Auxiliary generators:
- ab=c
- cc=d
- bd=e
- ba=f
- ff=g
- cf=h
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:abbaabba=bab h/efbcgda ab=c,cc=d,bd=e,ba=f,ff=g,cf=h morph:2/0,2/1,2/1,2/0,2/1,2/0
hhhhhe=ehhhhh
fhh=e
hhhhhf=ehhh
bh=hhf
hhhb=ehh
chh=hb
hhc=e
hhhhhg=ghhhhh
dhhh=hhhg
hhd=ghh
ahh=d
hha=g
ee=hhhhh
ehhhe=ghhhhhhh
ef=hhh
ehhhf=ghhhhh
ehb=ghhhh
ec=ghh
eg=hhhf
fe=ghh
fhe=ehc
ff=g
fb=hh
fg=ea
fhg=eha
be=hhfhc
bc=hh
bg=hhfha
bd=e
ba=f
ce=hhh
che=hhhfc
cf=h
chb=dhh
cc=d
cg=hf
chg=hhhfa
ge=ed
ghhe=ehhh
gf=ea
ghhf=eh
gb=e
ghhg=ehf
de=hhhf
dhe=hhhgc
dhhe=hhhghc
df=ch
dhb=cdhh
dc=cd
dg=chf
dhg=hhhga
dhhg=hhhgha
ae=cd
ahe=dhc
af=ca
ab=c
ag=da
ahg=dha