#4134 ⟨a, b | aba=aaa, baa=a⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 10
- Infinite non-cancellative non-commutative monoid
- Element b has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ a2 = a and a ⋅ 1 = a, however a2 ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
a2 ⋅ a = a and 1 ⋅ a = a, however a2 ≠ 1
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aba=aaa,baa=a ab - -
ba=aa
aaa=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
8 total
| Σ | # | Presentation | Mapping |
| 10 | 6389 | ⟨a, b | aab=b, aaabb=b⟩ | φ(a) = b, φ(b) = a |
| 10 | 6401 | ⟨a, b | aab=b, abaab=b⟩ | φ(a) = b, φ(b) = a |
| 10 | 6669 | ⟨a, b | aab=b, aaab=bb⟩ | φ(a) = b, φ(b) = a |
| 10 | 6675 | ⟨a, b | aab=b, aabb=ab⟩ | φ(a) = b, φ(b) = a |
| 10 | 6699 | ⟨a, b | aab=b, baab=ab⟩ | φ(a) = b, φ(b) = a |
| 10 | 6735 | ⟨a, b | aba=a, aaba=ba⟩ | φ(a) = a, φ(b) = b |
| 10 | 6819 | ⟨a, b | aab=b, abb=aab⟩ | φ(a) = b, φ(b) = a |
| 10 | 6843 | ⟨a, b | abb=b, bbb=abb⟩ | φ(a) = b, φ(b) = a |