#5606 ⟨a, b | aaabba=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 ⋅ a2b2a = aba2b and a ⋅ ba2b = aba2b, however a2b2a ≠ ba2b
- Enveloping group: ⟨a, b | aabbab-1a-1a-1b-1⟩
- Auxiliary generators:
- c = aba
- Reduction order:
- Right-to-left recursive path with deg(a) = 0; 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:aaabba=abaab reversed:a/cb aba=c morph:3/0
aba=c
cba=abc
aaabba=cab
cabba=aaabbc
caabba=abcab
caaabbca=aaabbcc
aaabbcab=caaabbc
aaabbccb=ccaaabbc
caabbcab=abcaaabbc
caabbccb=abccaaabbc
ccabbcab=aaabbcaaabbc
aaabbccaabbca=cccabbcc
ccabbccb=aaabbccaaabbc
caabbccaabbca=abcccabbcc
ccabbccaabbca=aaabbcccabbcc