#19486 ⟨a, b | aab=a, bbabb=ba⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element b has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ a3 = a and a ⋅ 1 = a, however a3 ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
a3 ⋅ a = a and 1 ⋅ a = a, however a3 ≠ 1
- Reduction order:
- Left-to-right recursive path with deg(a) = 0; deg(b) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aab=a,bbabb=ba a/b - -
aaaa=a
ab=aaa
bba=baaa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
2 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 19990 | ⟨a, b | aab=a, baaa=bba⟩ | φ(a) = a, φ(b) = b |
| 11 | 20028 | ⟨a, b | aab=a, bbab=baa⟩ | φ(a) = a, φ(b) = b |