#5068 ⟨a, b | aaa=ab, bbab=a⟩
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 ⋅ b = a3 and a ⋅ a2 = a3, however b ≠ a2
- Not right cancellative, because right multiplication by a is not injective:
-
a6 ⋅ a = a and 1 ⋅ a = a, however a6 ≠ 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:aaa=ab,bbab=a a/b - -
aaaaaaa=a
ab=aaa
bba=aaaaa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
8 total
| Σ | # | Presentation | Mapping |
| 11 | 14616 | ⟨a, b | aaba=b, aabbb=b⟩ | φ(a) = b, φ(b) = a |
| 11 | 14640 | ⟨a, b | aaba=b, baabb=b⟩ | φ(a) = b, φ(b) = a |
| 11 | 14644 | ⟨a, b | aaba=b, babab=b⟩ | φ(a) = b, φ(b) = a |
| 11 | 14646 | ⟨a, b | aaba=b, babba=b⟩ | φ(a) = b, φ(b) = a |
| 11 | 14652 | ⟨a, b | aaba=b, bbaab=b⟩ | φ(a) = b, φ(b) = a |
| 11 | 14654 | ⟨a, b | aaba=b, bbaba=b⟩ | φ(a) = b, φ(b) = a |
| 11 | 14658 | ⟨a, b | aaba=b, bbbaa=b⟩ | φ(a) = b, φ(b) = a |
| 11 | 15489 | ⟨a, b | aaa=ab, bbaaa=a⟩ | φ(a) = a, φ(b) = b |