#20722 ⟨a, b | ab=aa, aaaaa=ba⟩
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:
-
a5 ⋅ a = a3 and a2 ⋅ a = a3, however a5 ≠ a2
- 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,aaaaa=ba a/b - -
aaaaaa=aaa
ba=aaaaa
ab=aa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
15 total
| Σ | # | Presentation | Mapping |
| 11 | 20726 | ⟨a, b | ab=aa, aaaab=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20730 | ⟨a, b | ab=aa, aaaba=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20734 | ⟨a, b | ab=aa, aaabb=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20738 | ⟨a, b | ab=aa, aabaa=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20742 | ⟨a, b | ab=aa, aabab=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20746 | ⟨a, b | ab=aa, aabba=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20750 | ⟨a, b | ab=aa, aabbb=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20754 | ⟨a, b | ab=aa, abaaa=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20758 | ⟨a, b | ab=aa, abaab=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20762 | ⟨a, b | ab=aa, ababa=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20766 | ⟨a, b | ab=aa, ababb=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20770 | ⟨a, b | ab=aa, abbaa=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20774 | ⟨a, b | ab=aa, abbab=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20778 | ⟨a, b | ab=aa, abbba=ba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20782 | ⟨a, b | ab=aa, abbbb=ba⟩ | φ(a) = a, φ(b) = b |