#9372 ⟨a, b | ab=a, bbba=baa⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 10
- Infinite non-cancellative non-commutative monoid
- Element b 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:
-
a2 ⋅ a = a2 and a ⋅ a = a2, however a2 ≠ a
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:ab=a,bbba=baa ab - -
ab=a
aaa=aa
bbba=baa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
3 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 25640 | ⟨a, b | ab=a, bbbab=baa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25892 | ⟨a, b | ab=a, bbba=baab⟩ | φ(a) = a, φ(b) = b |
| 11 | 25893 | ⟨a, b | ab=a, bbba=baba⟩ | φ(a) = a, φ(b) = b |