#6248 ⟨a, b | aaa=a, aabab=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:aaa=a,aabab=a ac/b ab=c morph:2/0
cc=aa
aaa=a
aac=c
caa=c
ab=c
cb=cac
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
|---|
| 10 | 6541 | ⟨a, b | aaa=a, abab=aa⟩ | φ(a) = a, φ(b) = b |