#1596 ⟨a, b | aaa=ab, bba=a⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 9
- Infinite non-cancellative non-commutative monoid
- Element b has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ b = a3 and a ⋅ a2 = a3, however b ≠ a2
- Not right cancellative, because right multiplication by a is not injective:
-
b2 ⋅ a = a and 1 ⋅ a = a, however b2 ≠ 1
- 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:aaa=ab,bba=a a/b - -
aaaaaa=aa
ab=aaa
bba=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
6 total
| Σ | # | Presentation | Mapping |
| 11 | 19534 | ⟨a, b | aab=b, aabbb=ba⟩ | φ(a) = b, φ(b) = a |
| 11 | 19582 | ⟨a, b | aab=b, baabb=ba⟩ | φ(a) = b, φ(b) = a |
| 11 | 19590 | ⟨a, b | aab=b, babab=ba⟩ | φ(a) = b, φ(b) = a |
| 11 | 19606 | ⟨a, b | aab=b, bbaab=ba⟩ | φ(a) = b, φ(b) = a |
| 11 | 20071 | ⟨a, b | aab=b, aaba=bbb⟩ | φ(a) = b, φ(b) = a |
| 11 | 20106 | ⟨a, b | aab=b, abbb=aba⟩ | φ(a) = b, φ(b) = a |