#12285 ⟨a, b | aaab=ba, baab=b⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element a has infinite order
- Not left cancellative, because left multiplication by b is not injective:
-
b ⋅ b = b and b ⋅ 1 = b, however b ≠ 1
- Not right cancellative, because right multiplication by b is not injective:
-
b ⋅ b = b and 1 ⋅ b = b, however b ≠ 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:aaab=ba,baab=b reversed:a/b - -
aaaaaab=b
ba=aaab
bb=b
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
2 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 12287 | ⟨a, b | aaab=ba, baba=b⟩ | φ(a) = a, φ(b) = b |
| 11 | 12291 | ⟨a, b | aaab=ba, bbaa=b⟩ | φ(a) = a, φ(b) = b |