#9356 ⟨a, b | ab=a, bbaa=baa⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 10
- Infinite non-cancellative non-commutative monoid
- Element a has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ b = a and a ⋅ 1 = a, however b ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
b2a ⋅ a = ba2 and ba ⋅ a = ba2, however b2a ≠ ba
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:ab=a,bbaa=baa ab - -
ab=a
bbaa=baa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
4 total
| Σ | # | Presentation | Mapping |
| 11 | 25608 | ⟨a, b | ab=a, bbaab=baa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25616 | ⟨a, b | ab=a, bbaba=baa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25867 | ⟨a, b | ab=a, bbaa=baab⟩ | φ(a) = a, φ(b) = b |
| 11 | 25868 | ⟨a, b | ab=a, bbaa=baba⟩ | φ(a) = a, φ(b) = b |