#2874 ⟨a, b | aa=a, ababa=a⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 9
- Infinite non-cancellative non-commutative monoid
- Element abab2 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,ababa=a ab - -
aa=a
ababa=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
11 total
| Σ | # | Presentation | Mapping |
| 10 | 8586 | ⟨a, b | aa=a, aababa=a⟩ | φ(a) = a, φ(b) = b |
| 10 | 8600 | ⟨a, b | aa=a, abaaba=a⟩ | φ(a) = a, φ(b) = b |
| 10 | 8874 | ⟨a, b | aa=a, ababa=aa⟩ | φ(a) = a, φ(b) = b |
| 11 | 15629 | ⟨a, b | aab=ab, ababa=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 24064 | ⟨a, b | aa=a, aaababa=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 24078 | ⟨a, b | aa=a, aabaaba=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 24082 | ⟨a, b | aa=a, aababaa=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 24106 | ⟨a, b | aa=a, abaaaba=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 24623 | ⟨a, b | aa=a, aababa=aa⟩ | φ(a) = a, φ(b) = b |
| 11 | 24650 | ⟨a, b | aa=a, abaaba=aa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25184 | ⟨a, b | aa=a, ababa=aaa⟩ | φ(a) = a, φ(b) = b |