#5733 ⟨a, b | aabbaa=abaab⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 11
- Infinite non-cancellative non-commutative monoid
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ ab2a2 = aba2b and a ⋅ ba2b = aba2b, however ab2a2 ≠ ba2b
- Enveloping group: ⟨a, b | aabbab-1a-1a-1b-1⟩
- Auxiliary generators:
- c = ab
- Reduction order:
- Left-to-right recursive path with deg(c) = 0; deg(a) = deg(b) = 1, a < b
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aabbaa=abaab c/ab ab=c morph:2/0
ab=c
acbac=cacb
ccacbb=caccbac
acbaa=cac
caccbaa=ccacb
cacbcacb=caccbacac
cacbbac=acbcacb
caccbacaa=cacbcac
caccbacacac=cacbccacb
caccbacacb=ccacbcbac
cacbbaa=acbcac
ccacbcbaa=caccbacac
ccacbcbacac=caccbaccacb
caccbacacaa=cacbccac
cacbcaccbacac=caccbacaccacb
ccacbcbacaa=caccbaccac
caccbacaccbacac=ccacbcbaccacb