#1984 ⟨a, b | aaa=a, aaba=a⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 9
- Infinite non-cancellative non-commutative monoid
- Element a2b2 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:aaa=a,aaba=a ab - -
aaa=a
aba=aa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
12 total
| Σ | # | Presentation | Mapping |
| 10 | 5226 | ⟨a, b | aba=aa, aaba=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 12150 | ⟨a, b | aaaa=aa, aaba=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 12242 | ⟨a, b | aaab=ab, aaba=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 12246 | ⟨a, b | aaab=ab, abaa=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 14557 | ⟨a, b | aaba=a, ababa=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 15819 | ⟨a, b | aba=aa, ababa=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 18692 | ⟨a, b | aaa=a, aaaaba=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 18696 | ⟨a, b | aaa=a, aaabaa=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 19239 | ⟨a, b | aaa=a, aaaba=aa⟩ | φ(a) = a, φ(b) = b |
| 11 | 19247 | ⟨a, b | aaa=a, aabaa=aa⟩ | φ(a) = a, φ(b) = b |
| 11 | 19778 | ⟨a, b | aaa=a, aaaa=aba⟩ | φ(a) = a, φ(b) = b |
| 11 | 19790 | ⟨a, b | aaa=a, aaba=aaa⟩ | φ(a) = a, φ(b) = b |