#1257 ⟨a, b | aa=1, bbb=bab⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 8
- Infinite non-cancellative non-commutative monoid
- Element b has infinite order
- Not left cancellative, because left multiplication by b is not injective:
-
b ⋅ ab = b3 and b ⋅ b2 = b3, however ab ≠ b2
- Not right cancellative, because right multiplication by b is not injective:
-
ba ⋅ b = b3 and b2 ⋅ b = b3, however ba ≠ b2
- Reduction order:
- Left-to-right shortlex with b < a
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aa=1,bbb=bab ba - -
aa=1
bab=bbb
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
5 total
| Σ | # | Presentation | Mapping |
| 10 | 10243 | ⟨a, b | aa=1, aabab=bbb⟩ | φ(a) = a, φ(b) = b |
| 10 | 10257 | ⟨a, b | aa=1, aabbb=bab⟩ | φ(a) = a, φ(b) = b |
| 10 | 10309 | ⟨a, b | aa=1, baaab=bbb⟩ | φ(a) = a, φ(b) = b |
| 10 | 10315 | ⟨a, b | aa=1, baabb=bab⟩ | φ(a) = a, φ(b) = b |
| 10 | 10496 | ⟨a, b | aa=1, abbb=abab⟩ | φ(a) = a, φ(b) = b |