#19793 ⟨a, b | aaa=a, aaba=abb⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element aba has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ a2 = a and a ⋅ 1 = a, however a2 ≠ 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 recursive path with deg(a) = 0; deg(b) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aaa=a,aaba=abb a/b - -
aaa=a
abb=aaba
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 11 | 19800 | ⟨a, b | aaa=a, aabb=aba⟩ | φ(a) = a, φ(b) = b |