#20094 ⟨a, b | aab=b, abab=bba⟩
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) = 0; deg(b) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aab=b,abab=bba reversed:a/b
aab=b
bba=abab
babab=abbb
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 11 | 20101 | ⟨a, b | aab=b, abba=bab⟩ | φ(a) = a, φ(b) = b |