#1777 ⟨a, b | ababaaaab=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 ⋅ baba4b = a and a ⋅ 1 = a, however baba4b ≠ 1
- Enveloping group: ⟨a, b | aaabba-1b⟩
- Auxiliary generators:
- c = ab
- d = caa
- e = ada
- Reduction order:
- Right-to-left recursive path with deg(b) = deg(d) = deg(c) = 0, b < d < c; deg(e) = 1; deg(a) = 2
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:ababaaaab=a reversed:bdc/e/a ab=c,caa=d,ada=e morph:2/1,3/3,3/0
ddeb=dbdcdcccde
dbdeb=ccdcccde
dcdeb=dbdcccde
dbcdeb=ccccde
dccdeb=dbccde
dbccdeb=d
ed=cdcde
ec=cccde
cccdebb=c
ddcccdebd=dbdcde
dbdcccdebd=ccde
dcdcccdebd=dbde
ccdcccdebd=dcccdeb
dbcdcccdebd=ce
dcccdebc=ccdeb
ccccdebc=db
ccccdebdb=dbcccdebc
cccdebdc=eb
ccccdebe=ddcccdeb
eeb=cccdebccdcdcdcccde
dcccdebeb=ccdcdcdcccde
dbcccdebeb=ccccdebddc
ebdeb=cccdebdbdcccde
ebcdeb=cccdebdbccde
ebccdeb=e
dbcccdebcccdeb=ccccdebd
ccccdebddcccdeb=dbcccdebe
ebdcccdebd=cccdebdbde
ebcdcccdebd=cccdebddcccdeb
ebcccdebc=cccdebddb
ebcccdebdb=cccdebddbcccdebc
ebcccdebe=cccdebdddcccdeb
ebcccdebddcccdeb=cccdebddbcccdebe
a=cccdeb