#3024 ⟨a, b | aa=a, abbb=ba⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 9
- 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 recursive path with deg(b) = 0; deg(a) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aa=a,abbb=ba b/a - -
abbbbbbbbb=abbb
ba=abbb
aa=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
5 total
| Σ | # | Presentation | Mapping |
|---|
| 10 | 8868 | ⟨a, b | aa=a, aabbb=ba⟩ | φ(a) = a, φ(b) = b |
| 10 | 9160 | ⟨a, b | aa=a, abbb=baa⟩ | φ(a) = a, φ(b) = b |
| 11 | 24617 | ⟨a, b | aa=a, aaabbb=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 25172 | ⟨a, b | aa=a, aabbb=baa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25689 | ⟨a, b | aa=a, baaa=abbb⟩ | φ(a) = a, φ(b) = b |