#2255 ⟨a, b | aabbaab=aba⟩
Contents
- Properties
- Rewriting system
- Sum of relation sides is 10
- Infinite non-cancellative non-commutative monoid
- Element a has infinite order
- Not left cancellative, because left multiplication by f is not injective:
-
f ⋅ ge = f2 and f ⋅ f = f2, however ge ≠ f
- Auxiliary generators:
- c = ba
- d = aabc
- e = bd
- f = cc
- g = ab
- Reduction order:
- Left-to-right recursive path with deg(e) = deg(f) = 0, e < f; deg(d) = 1; deg(g) = deg(c) = 2, g < c; deg(b) = 3; deg(a) = 4
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aabbaab=aba ef/d/gc/b/a ba=c,aabc=d,bd=e,cc=f,ab=g morph:2/1,4/0,2/0,2/0,2/0
fe=ef
ffd=eedf
eg=f
fge=ff
fgd=edf
fgfd=efdf
efg=ff
ffg=fgf
dge=df
dgfd=dedf
dfg=dgf
ece=cff
ecd=cedf
ecfd=cefdf
fc=cf
dcee=gdff
dcd=gddf
dced=gdedf
dcfd=gdfdf
dcefd=gdefdf
edce=fdgf
fdce=edgff
ggd=df
gdgf=dce
dgge=dgf
dggfd=dfdf
dgfg=dggf
edggf=fdc
fdgg=edc
gdc=dggf
fgc=ce
dgc=gdg
cge=cf
cgf=ec
cfg=ec
ecgd=cfdf
dcgd=gdgdf
cc=f
cec=fgf
ceec=fgfgf
gdgg=dc
fgfgfgf=ceeec
dggfgf=gdec
dggc=gd
cgc=e
bd=e
bgd=ce
fb=bgg
dgb=gg
cb=bg
ceb=fgbg
fgfgbg=ceeb
dggbg=gdb
cgbg=eb
dggfgbg=gdeb
ae=gd
af=gdg
age=gdg
agf=dc
ac=dg
agc=d
ab=g
agbg=db
fa=edg
ga=dg
eca=cfdg
dca=gdgdg
dcea=gdfdg
ba=c