#9256 ⟨a, b | ab=a, aaaa=aaa⟩
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 ⋅ b = a and a ⋅ 1 = a, however b ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
a3 ⋅ a = a3 and a2 ⋅ a = a3, however a3 ≠ a2
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:ab=a,aaaa=aaa ab - -
ab=a
aaaa=aaa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
7 total
| Σ | # | Presentation | Mapping |
| 11 | 25412 | ⟨a, b | ab=a, aaaab=aaa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25420 | ⟨a, b | ab=a, aaaba=aaa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25436 | ⟨a, b | ab=a, aabaa=aaa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25468 | ⟨a, b | ab=a, abaaa=aaa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25792 | ⟨a, b | ab=a, aaab=aaaa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25793 | ⟨a, b | ab=a, aaba=aaaa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25798 | ⟨a, b | ab=a, abaa=aaaa⟩ | φ(a) = a, φ(b) = b |