#27687 ⟨a, b | aa=1, abbbba=bbb⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element ba has infinite order
- Not left cancellative, because left multiplication by b is not injective:
-
b ⋅ b9 = b3 and b ⋅ b2 = b3, however b9 ≠ b2
- Not right cancellative, because right multiplication by b is not injective:
-
b9 ⋅ b = b3 and b2 ⋅ b = b3, however b9 ≠ b2
- Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(a) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aa=1,abbbba=bbb b/a - -
bbbbbbbbbb=bbb
babbb=abbbbbbbbb
bbba=abbbb
aa=1
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
2 total
| Σ | # | Presentation | Mapping |
| 11 | 28207 | ⟨a, b | aa=1, abbba=bbbb⟩ | φ(a) = a, φ(b) = b |
| 11 | 28222 | ⟨a, b | aa=1, abbbb=bbba⟩ | φ(a) = a, φ(b) = b |