#21090 ⟨a, b | bb=aa, aaab=aaa⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element ab has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ a2b = a3 and a ⋅ a2 = a3, however a2b ≠ a2
- Not right cancellative, because right multiplication by a is not injective:
-
a2b ⋅ a = a3 and a2 ⋅ a = a3, however a2b ≠ a2
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:bb=aa,aaab=aaa ab - -
bb=aa
baa=aab
aaab=aaa
aaba=aaa
aaaaa=aaa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
11 total
| Σ | # | Presentation | Mapping |
| 11 | 21091 | ⟨a, b | bb=aa, aaab=aab⟩ | φ(a) = b, φ(b) = a |
| 11 | 21093 | ⟨a, b | bb=aa, aaab=abb⟩ | φ(a) = a, φ(b) = b |
| 11 | 21094 | ⟨a, b | bb=aa, aaab=baa⟩ | φ(a) = b, φ(b) = a |
| 11 | 21096 | ⟨a, b | bb=aa, aaab=bba⟩ | φ(a) = a, φ(b) = b |
| 11 | 21097 | ⟨a, b | bb=aa, aaab=bbb⟩ | φ(a) = b, φ(b) = a |
| 11 | 21098 | ⟨a, b | bb=aa, aaba=aaa⟩ | φ(a) = a, φ(b) = b |
| 11 | 21099 | ⟨a, b | bb=aa, aaba=aab⟩ | φ(a) = b, φ(b) = a |
| 11 | 21101 | ⟨a, b | bb=aa, aaba=abb⟩ | φ(a) = a, φ(b) = b |
| 11 | 21102 | ⟨a, b | bb=aa, aaba=baa⟩ | φ(a) = b, φ(b) = a |
| 11 | 21104 | ⟨a, b | bb=aa, aaba=bba⟩ | φ(a) = a, φ(b) = b |
| 11 | 21105 | ⟨a, b | bb=aa, aaba=bbb⟩ | φ(a) = b, φ(b) = a |