#1990 ⟨a, b | aaa=a, abba=a⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 9
- Infinite non-cancellative non-commutative monoid
- Element aba has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ a2 = a and a ⋅ 1 = a, however a2 ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
a2 ⋅ a = a and 1 ⋅ a = a, however a2 ≠ 1
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aaa=a,abba=a ab - -
aaa=a
abba=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
5 total
| Σ | # | Presentation | Mapping |
| 11 | 12250 | ⟨a, b | aaab=ab, abba=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 18700 | ⟨a, b | aaa=a, aaabba=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 18710 | ⟨a, b | aaa=a, aabbaa=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 19254 | ⟨a, b | aaa=a, aabba=aa⟩ | φ(a) = a, φ(b) = b |
| 11 | 19814 | ⟨a, b | aaa=a, abba=aaa⟩ | φ(a) = a, φ(b) = b |