#3563 ⟨a, b | aabaababaa=a⟩
Quick links
- Properties
- Rewriting system
- Isomorphic instances
- Presentation has sum-of-sides 11
- Infinite non-commutative monoid
- Reduction order:
- Right-to-left recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1
- Auxiliary generators:
- aba=c
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aabaababaa=a reversed:ac/b aba=c morph:3/0
aacc=caca
cacc=a
aba=c
abc=cba
cbaa=accccba
cbca=cccccba
cbac=accccbc
cbcc=cccccbc
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
2 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 3582 | ⟨a, b | aababaaaba=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 3715 | ⟨a, b | abaaabaaba=a⟩ | φ(a) = a, φ(b) = b |