#19733 ⟨a, b | aba=b, aabbb=bb⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element a has infinite order
- Not left cancellative, because left multiplication by b is not injective:
-
b ⋅ b2 = b2 and b ⋅ b = b2, however b2 ≠ b
- Not right cancellative, because right multiplication by b is not injective:
-
b2 ⋅ b = b2 and b ⋅ b = b2, however b2 ≠ b
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aba=b,aabbb=bb ab - -
aba=b
bba=abb
bbb=bb
aabb=bb
babb=abb
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
6 total
| Σ | # | Presentation | Mapping |
| 11 | 19744 | ⟨a, b | aba=b, ababb=bb⟩ | φ(a) = a, φ(b) = b |
| 11 | 19748 | ⟨a, b | aba=b, abbab=bb⟩ | φ(a) = a, φ(b) = b |
| 11 | 19751 | ⟨a, b | aba=b, abbba=bb⟩ | φ(a) = a, φ(b) = b |
| 11 | 19762 | ⟨a, b | aba=b, baabb=bb⟩ | φ(a) = a, φ(b) = b |
| 11 | 19765 | ⟨a, b | aba=b, babab=bb⟩ | φ(a) = a, φ(b) = b |
| 11 | 20285 | ⟨a, b | aba=b, abab=bbb⟩ | φ(a) = a, φ(b) = b |