#5186 ⟨a, b | aab=ba, bbba=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:
-
a7 ⋅ a = a and 1 ⋅ a = a, however a7 ≠ 1
- 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,bbba=a reversed:a/b - -
aaaaaaaa=a
ba=aab
abbb=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
2 total
| Σ | # | Presentation | Mapping |
| 11 | 14486 | ⟨a, b | aaab=b, aabba=b⟩ | φ(a) = b, φ(b) = a |
| 11 | 15723 | ⟨a, b | aab=ba, bbaab=a⟩ | φ(a) = a, φ(b) = b |