#4653 ⟨a, b | aaab=a, abaa=a⟩
Quick links
- Properties
- Rewriting system
- Isomorphic instances
- Presentation has sum-of-sides 10
- Infinite non-commutative monoid
- Auxiliary generators:
- c = ab
- Reduction order:
- Left-to-right recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aaab=a,abaa=a ac/b ab=c morph:2/0
ca=ac
aac=a
acc=c
ab=c
cb=ccc
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
3 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 12934 | ⟨a, b | aba=aab, aaab=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 12936 | ⟨a, b | aba=aab, aaba=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 12940 | ⟨a, b | aba=aab, abaa=a⟩ | φ(a) = a, φ(b) = b |