#19005 ⟨a, b | aab=b, ababba=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 ⋅ a2 = b and b ⋅ 1 = b, however a2 ≠ 1
- 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(a) = 0; deg(b) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aab=b,ababba=b reversed:a/b - -
aab=b
baa=b
babb=aba
bbba=ababab
bbaba=abbab
bababa=abbb
bbbbb=b
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 19593 | ⟨a, b | aab=b, babba=ab⟩ | φ(a) = a, φ(b) = b |