#2892 ⟨a, b | aa=a, bbabb=a⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 9
- Infinite non-cancellative non-commutative monoid
- Element ba has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ a = a and a ⋅ 1 = a, however a ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
a ⋅ a = a and 1 ⋅ a = a, however a ≠ 1
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aa=a,bbabb=a ab - -
aa=a
bba=abb
abbbb=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
6 total
| Σ | # | Presentation | Mapping |
| 10 | 8634 | ⟨a, b | aa=a, bbaabb=a⟩ | φ(a) = a, φ(b) = b |
| 10 | 8906 | ⟨a, b | aa=a, bbabb=aa⟩ | φ(a) = a, φ(b) = b |
| 11 | 15663 | ⟨a, b | aab=ab, bbabb=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 24176 | ⟨a, b | aa=a, bbaaabb=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 24714 | ⟨a, b | aa=a, bbaabb=aa⟩ | φ(a) = a, φ(b) = b |
| 11 | 25248 | ⟨a, b | aa=a, bbabb=aaa⟩ | φ(a) = a, φ(b) = b |