#20990 ⟨a, b | ab=aa, baaa=bba⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element b has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ b = a2 and a ⋅ a = a2, however b ≠ a
- Not right cancellative, because right multiplication by a is not injective:
-
b2 ⋅ a = ba3 and ba2 ⋅ a = ba3, however b2 ≠ ba2
- 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:ab=aa,baaa=bba a/b - -
aaaaa=aaaa
ab=aa
bba=baaa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
3 total
| Σ | # | Presentation | Mapping |
| 11 | 20998 | ⟨a, b | ab=aa, baab=bba⟩ | φ(a) = a, φ(b) = b |
| 11 | 21006 | ⟨a, b | ab=aa, baba=bba⟩ | φ(a) = a, φ(b) = b |
| 11 | 21014 | ⟨a, b | ab=aa, babb=bba⟩ | φ(a) = a, φ(b) = b |