#5852 ⟨a, b | abaaba=abbab⟩
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 ⋅ ba2ba = ab2ab and a ⋅ b2ab = ab2ab, however ba2ba ≠ b2ab
- Enveloping group: ⟨a, b | aabab-1b-1⟩
- Auxiliary generators:
- c = aba
- Reduction order:
- Left-to-right recursive path with deg(c) = 0; deg(b) = deg(a) = 1, b < a
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:abaaba=abbab c/ba aba=c morph:3/0
abc=cba
ccacbc=ccbcca
ccaca=ccbc
ccbcbbc=ccaccca
ccbcbcb=ccaccac
ccbcba=ccacc
cbacbc=cbbcca
ccbab=ccac
cbaca=cbbc
abbc=cca
ccaccbbc=ccbcbcca
aba=c
ccaccba=ccbcbc
cbbcbbc=cbaccca
cbbcbcb=cbaccac
cbbcba=cbacc
cbbab=cbac
cbaccbbc=cbbcbcca
cbaccba=cbbcbc
ccacbab=ccbcc
cbacbab=cbbcc
abbab=cc