#1603 ⟨a, b | aaaabbbaa=a⟩
Quick links
- Properties
- Rewriting system
- Isomorphic instances
- Presentation has sum-of-sides 10
- Infinite non-cancellative non-commutative monoid
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ a3b3a2 = a and a ⋅ 1 = a, however a3b3a2 ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
a4b3a ⋅ a = a and 1 ⋅ a = a, however a4b3a ≠ 1
- Enveloping group: ⟨a, b | aaaaabbb⟩
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aaaabbbaa=a ab
abbbaa=aabbba
aaaaabbba=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
|---|
| 10 | 1649 | ⟨a, b | aaabbbaaa=a⟩ | φ(a) = a, φ(b) = b |