#11590 ⟨a, b | baaab=a, bbbbb=1⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element a has infinite order
- Not left cancellative, because left multiplication by c is not injective:
-
c ⋅ ca2 = c and c ⋅ 1 = c, however ca2 ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
ca2 ⋅ a = a and 1 ⋅ a = a, however ca2 ≠ 1
- Auxiliary generators:
- c = baabaabaabaab
- Reduction order:
- Left-to-right recursive path with deg(c) = deg(a) = 0, c < a; deg(b) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:baaab=a,bbbbb=1 ca/b baabaabaabaab=c morph:13/0
ac=ca
ccaa=c
caaa=a
cbcaa=cb
abcaa=ab
ccb=bcc
aab=cbaaaa
ccab=abcc
bcab=cca
cbbcaa=cbb
abbcaa=abb
bbbc=cabcbaaaaa
bbba=cabcbaaaaaaaa
bcbcb=abbcccccca
cbbb=abcbaaa
abbb=bcbaaaaaaa
abbabb=bcbabcbaaaaaaaaaaaaaaa
abcbabcb=cbbabbcccccca
bbbbb=1
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 11 | 12859 | ⟨a, b | bab=aaa, bbbbb=1⟩ | φ(a) = a, φ(b) = bbbb |