#1985 ⟨a, b | aaa=a, aaba=b⟩
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 b is not injective:
-
b ⋅ a = b and b ⋅ 1 = b, however a ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
a2 ⋅ a = a and 1 ⋅ a = a, however a2 ≠ 1
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aaa=a,aaba=b ab - -
ba=b
aaa=a
aab=b
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 18693 | ⟨a, b | aaa=a, aaaaba=b⟩ | φ(a) = a, φ(b) = b |