#27121 ⟨a, b | aa=1, ababbab=bb⟩
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 ⋅ b5 = b2 and b ⋅ b = b2, however b5 ≠ b
- Not right cancellative, because right multiplication by b is not injective:
-
b5 ⋅ b = b2 and b ⋅ b = b2, however b5 ≠ b
- Reduction order:
- Right-to-left recursive path with deg(a) = 0; deg(b) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aa=1,ababbab=bb reversed:a/b - -
aa=1
bbbab=abababb
babbab=abb
bbabab=abbabb
babbbb=ababb
bababbb=bbab
babababb=abbbbb
bbbbbb=bb
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 27737 | ⟨a, b | aa=1, babbab=abb⟩ | φ(a) = a, φ(b) = b |