#2317 ⟨a, b | abaabba=baa⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 10
- Infinite non-cancellative non-commutative monoid
- Not right cancellative, because right multiplication by a is not injective:
-
aba2b2 ⋅ a = ba2 and ba ⋅ a = ba2, however aba2b2 ≠ ba
- Enveloping group: ⟨a, b | aabab-1a-1bb⟩
- Auxiliary generators:
- c = baabb
- d = acc
- Reduction order:
- Left-to-right recursive path with deg(a) = deg(d) = 0, a < d; deg(c) = deg(b) = 1, c < b
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:abaabba=baa ad/cb baabb=c,acc=d morph:5/1,3/0
acada=caa
acadd=cad
bd=dc
baa=aca
bad=acd
acc=d
acadc=cac
bcd=dadcc
bcaa=dada
bcad=dadd
bac=d
dabb=bc
acadbc=cabc
caabb=acabc
acabb=c
bcc=dadcabb
bcac=dadc
bbc=dcabb
babc=acbc
acacabc=daabb
bcbc=dadccabb
bcabc=dadbc