#1040 ⟨a, b, c | ab=c, bca=a⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 7
- Infinite non-cancellative non-commutative monoid
- Element a has infinite order
- Not right cancellative, because right multiplication by a is not injective:
-
bab ⋅ a = a and 1 ⋅ a = a, however bab ≠ 1
- Reduction order:
- Left-to-right recursive path with deg(a) = deg(b) = 0, a < b; deg(c) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# abc:ab=c,bca=a ab/c - -
baa=aba
baba=a
c=ab
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
|---|
| 8 | 5560 | ⟨a, b, c | ab=c, baba=a⟩ | φ(a) = a, φ(b) = b, φ(c) = ab |