#244 ⟨a, b | aa=a, bab=b⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 7
- Infinite non-cancellative non-commutative monoid
- Element b has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ a = a and a ⋅ 1 = a, however a ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
a ⋅ a = a and 1 ⋅ a = a, however a ≠ 1
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aa=a,bab=b ab - -
aa=a
bab=b
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
4 total
| Σ | # | Presentation | Mapping |
|---|
| 8 | 895 | ⟨a, b | aa=a, baab=b⟩ | φ(a) = a, φ(b) = b |
| 9 | 2885 | ⟨a, b | aa=a, baaab=b⟩ | φ(a) = a, φ(b) = b |
| 10 | 8621 | ⟨a, b | aa=a, baaaab=b⟩ | φ(a) = a, φ(b) = b |
| 11 | 24149 | ⟨a, b | aa=a, baaaaab=b⟩ | φ(a) = a, φ(b) = b |