#7086 ⟨a, b | ab=aa, baaa=aa⟩
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 = a2 and a ⋅ a = a2, however b ≠ a
- Not right cancellative, because right multiplication by a is not injective:
-
a3 ⋅ a = a2 and a ⋅ a = a2, however a3 ≠ a
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:ab=aa,baaa=aa ab - -
ab=aa
baa=aaa
aaaa=aa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
7 total
| Σ | # | Presentation | Mapping |
| 10 | 7087 | ⟨a, b | ab=aa, baaa=ab⟩ | φ(a) = a, φ(b) = b |
| 10 | 7090 | ⟨a, b | ab=aa, baab=aa⟩ | φ(a) = a, φ(b) = b |
| 10 | 7091 | ⟨a, b | ab=aa, baab=ab⟩ | φ(a) = a, φ(b) = b |
| 10 | 7094 | ⟨a, b | ab=aa, baba=aa⟩ | φ(a) = a, φ(b) = b |
| 10 | 7095 | ⟨a, b | ab=aa, baba=ab⟩ | φ(a) = a, φ(b) = b |
| 10 | 7098 | ⟨a, b | ab=aa, babb=aa⟩ | φ(a) = a, φ(b) = b |
| 10 | 7099 | ⟨a, b | ab=aa, babb=ab⟩ | φ(a) = a, φ(b) = b |