#5215 ⟨a, b | aab=bb, bbaa=b⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 10
- Infinite non-cancellative non-commutative monoid
- Element a has infinite order
- Not left cancellative, because left multiplication by b is not injective:
-
b ⋅ a4 = b and b ⋅ 1 = b, however a4 ≠ 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:aab=bb,bbaa=b a/b - -
baaaa=b
aab=baa
bb=baa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
3 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 14719 | ⟨a, b | aabb=a, bbabb=a⟩ | φ(a) = b, φ(b) = a |
| 11 | 14829 | ⟨a, b | abba=a, bbabb=a⟩ | φ(a) = b, φ(b) = a |
| 11 | 15746 | ⟨a, b | aab=bb, aabaa=b⟩ | φ(a) = a, φ(b) = b |