#26689 ⟨a, b | aa=1, babbbbab=b⟩
Quick links
- Properties
- Rewriting system
- Isomorphic instances
- Presentation has sum-of-sides 11
- Infinite non-commutative monoid
- Auxiliary generators:
- c = bab
- Reduction order:
- Left-to-right shortlex with a < b < c
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aa=1,babbbbab=b abc bab=c morph:3/0
aa=1
bab=c
cab=bac
bbac=bacb
bcac=bacc
cbac=cacb
cbbb=bbbc
cbbc=b
ccac=cacc
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 11 | 26701 | ⟨a, b | aa=1, bbababbb=b⟩ | φ(a) = a, φ(b) = b |