#5172 ⟨a, b | aab=ba, abbb=a⟩
Contents
- Properties
- Rewriting system
- 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 ⋅ b3 = a and a ⋅ 1 = a, however b3 ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
a8 ⋅ a = a2 and a ⋅ a = a2, however a8 ≠ a
- 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,abbb=a reversed:a/b - -
aaaaaaaaa=aa
ba=aab
abbb=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 11 | 12497 | ⟨a, b | abaa=bb, baaa=b⟩ | φ(a) = b, φ(b) = a |