#4987 ⟨a, b | aaaabba=baaa⟩
Contents
- Properties
- Rewriting system
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element a has infinite order
- Not right cancellative, because right multiplication by a is not injective:
-
a4b2 ⋅ a = ba3 and ba2 ⋅ a = ba3, however a4b2 ≠ ba2
- Auxiliary generators:
- c = bbaaa
- d = bba
- e = aadad
- Reduction order:
- Left-to-right recursive path with deg(a) = deg(c) = 0, a < c; deg(e) = deg(d) = 1, e < d; deg(b) = 2
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aaaabba=baaa ac/ed/b bbaaa=c,bba=d,aadad=e morph:5/1,3/1,5/0
aae=c
aacae=eaa
dc=ce
daa=c
dac=cae
dec=ccaee
deaa=ccae
deac=ccaeae
daec=cacaee
daeaa=cacae
daeac=cacaeae
cdad=de
aadad=e
cadad=dae
dee=ccaedad
deae=ccaeadad
daee=cacaedad
daeae=cacaeadad
dde=cedad
ddae=ceadad
dade=caedad
dadae=caeadad
dede=ccaeedad
dedae=ccaeeadad
deade=ccaeaedad
deadae=ccaeaeadad
daede=cacaeedad
daedae=cacaeeadad
daeade=cacaeaedad
daeadae=cacaeaeadad
bc=cad
bac=aaaade
baaa=aaaad
baac=aaaadae
bec=aaaacacaeacaedad
beaa=aaaacacaeadad
beac=aaaacacaeacaeadad
bae=aaaaddad
bee=aaaacacaeadaddad
beae=aaaacacaeadadadad
bde=caddad
bdae=daead
bade=aaaadedad
badae=aaaadeadad
baade=aaaadaedad
baadae=aaaadaeadad
bede=aaaacacaeacaedaddad
bedae=aaaacacaeacaedadadad
beade=aaaacacaeacaeadaddad
beadae=aaaacacaeacaeadadadad
bba=d
bbe=dadad