#5394 ⟨a, b | aab=ba, abb=aa⟩
Contents
- Properties
- Rewriting system
- Anti-isomorphic instances
- Sum of relation sides is 10
- Infinite non-cancellative non-commutative monoid
- Element b has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ b2 = a2 and a ⋅ a = a2, however b2 ≠ a
- Not right cancellative, because right multiplication by a is not injective:
-
a3 ⋅ a = a3 and a2 ⋅ a = a3, however a3 ≠ a2
- Reduction order:
- Right-to-left recursive path with deg(a) = 0; deg(b) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aab=ba,abb=aa reversed:a/b - -
aaaa=aaa
ba=aab
abb=aa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 11 | 16279 | ⟨a, b | aab=bb, aaab=ba⟩ | φ(a) = b, φ(b) = a |