#2461 ⟨a, b | aaabba=baaa⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 10
- Infinite non-commutative monoid
- Reduction order:
- Right-to-left recursive path with deg(a) = deg(f) = 0, a < f; deg(e) = 1; deg(d) = deg(c) = deg(b) = 2, d < c < b
- Auxiliary generators:
- bba=c
- cc=d
- dad=e
- eaa=f
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aaabba=baaa reversed:af/e/dcb bba=c,cc=d,dad=e,eaa=f morph:3/2,2/2,3/2,3/0
aaaff=faa
aaafe=f
ef=fafe
eaa=f
eaf=faafe
df=aaafaafee
daa=aaae
daf=faae
dae=ead
cf=aaafaaee
caa=aaad
caf=aaaaaafafee
bf=aaaaaafaaeee
baf=aaaaaaaaafafeee
baaa=aaac
baaf=aaaaaaaaafaafeee
dad=e
dc=cd
dace=ecad
cc=d
bba=c
dacd=ec