#2617 ⟨a, b | abbaab=aaba⟩
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 ⋅ b2a2b = a2ba and a ⋅ aba = a2ba, however b2a2b ≠ aba
- Enveloping group: ⟨a, b | aabab-1abb⟩
- Auxiliary generators:
- c = ab
- d = cbcb
- Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(c) = deg(a) = deg(d) = 1, c < a < d
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:abbaab=aaba b/cad ab=c,cbcb=d morph:2/1,4/1
ab=c
cbcb=d
dcb=cbd
acc=cbacb
aca=cbac
cbacbbcb=acd
dacbbcb=cbacd
cbacbbac=dacba
dacbccb=cbacbbad
dacbac=acdacb
dacbbac=cbdacba
dacbaa=acdac
dadacbb=acdad
acdacbc=dadacb
acdacbbbcb=daacd
acdacba=dadac
acdacbbbac=dadacba
dacbcacbbcb=cbacbbaacd
dacbdacbc=acdadacb
dacbdacbbbcb=acdaacd
dacbdacba=acdadac
dacbcacbbac=cbacbbadacba
dacbadacbc=cbacbbdadacb
dacbadacbbbcb=cbacbbdaacd
dacbadacba=cbacbbdadac
dacbdacbbbac=acdadacba
dacbadacbbbac=cbacbbdadacba