#5388 ⟨a, b | aab=ab, bba=ab⟩
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 ⋅ ba2 = b2a and b ⋅ ba = b2a, however ba2 ≠ ba
- Not right cancellative, because right multiplication by a is not injective:
-
b2a ⋅ a = b2a and b2 ⋅ a = b2a, however b2a ≠ b2
- Reduction order:
- Right-to-left recursive path with deg(b) = 0; deg(a) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aab=ab,bba=ab reversed:b/a - -
bbbba=bba
ab=bba
bbaa=bba
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
5 total
| Σ | # | Presentation | Mapping |
| 11 | 16247 | ⟨a, b | aab=ba, baab=ba⟩ | φ(a) = b, φ(b) = a |
| 11 | 16251 | ⟨a, b | aab=ba, baba=ba⟩ | φ(a) = b, φ(b) = a |
| 11 | 16259 | ⟨a, b | aab=ba, bbaa=ba⟩ | φ(a) = b, φ(b) = a |
| 11 | 16505 | ⟨a, b | aab=ab, bba=aab⟩ | φ(a) = a, φ(b) = b |
| 11 | 16514 | ⟨a, b | aab=ba, bba=aab⟩ | φ(a) = b, φ(b) = a |