#9147 ⟨a, b | aa=a, abab=bab⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 10
- Infinite non-cancellative non-commutative monoid
- Element b 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
- Auxiliary generators:
- c = ab
- Reduction order:
- Left-to-right shortlex with a < c < b
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aa=a,abab=bab acb ab=c morph:2/0
aa=a
ac=c
ab=c
bc=cc
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
3 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 25157 | ⟨a, b | aa=a, aabab=bab⟩ | φ(a) = a, φ(b) = b |
| 11 | 25181 | ⟨a, b | aa=a, abaab=bab⟩ | φ(a) = a, φ(b) = b |
| 11 | 25694 | ⟨a, b | aa=a, baab=abab⟩ | φ(a) = a, φ(b) = b |