#5380 ⟨a, b | aab=ab, baa=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 ⋅ a4 = ba2 and b ⋅ a2 = ba2, however a4 ≠ a2
- Not right cancellative, because right multiplication by a is not injective:
-
ba3 ⋅ a = ba2 and ba ⋅ a = ba2, however ba3 ≠ ba
- 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=ab,baa=ab a/b - -
baaaa=baa
ab=baa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 11 | 16502 | ⟨a, b | aab=ab, baa=aab⟩ | φ(a) = a, φ(b) = b |