#9749 ⟨a, b | aa=1, abbabbb=b⟩
Quick links
- Properties
- Rewriting system
- Isomorphic instances
- Presentation has sum-of-sides 10
- Infinite non-commutative monoid
- Auxiliary generators:
- c = bab
- 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:aa=1,abbabbb=b ac/b bab=c morph:3/0
aa=1
ccc=c
ccac=ac
bcc=b
cb=abcacc
cab=bac
bab=c
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
|---|
| 10 | 10058 | ⟨a, b | aa=1, bbabbb=ab⟩ | φ(a) = a, φ(b) = b |