#19559 ⟨a, b | aab=b, abbab=bb⟩
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(ab)2 = b2 and b ⋅ b = b2, however b(ab)2 ≠ b
- Not right cancellative, because right multiplication by b is not injective:
-
a2 ⋅ b = b and 1 ⋅ b = b, however a2 ≠ 1
- Reduction order:
- Right-to-left recursive path with deg(b) = 0; deg(a) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aab=b,abbab=bb reversed:b/a - -
bbbbbb=bbb
abb=bbab
aab=b
bbabab=bb
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 20155 | ⟨a, b | aab=b, bbab=abb⟩ | φ(a) = a, φ(b) = b |