#19163 ⟨a, b | aba=b, aaaaab=b⟩
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 ⋅ a5 = b and b ⋅ 1 = b, however a5 ≠ 1
- Reduction order:
- Left-to-right recursive path with deg(a) = 0; deg(b) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aba=b,aaaaab=b a/b - -
baaaaa=b
ab=baaaa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
2 total
| Σ | # | Presentation | Mapping |
| 11 | 19709 | ⟨a, b | aba=b, aaaab=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20258 | ⟨a, b | aba=b, aaab=baa⟩ | φ(a) = a, φ(b) = b |