#8903 ⟨a, b | aa=a, babbb=ab⟩
Quick links
- Properties
- Rewriting system
- Isomorphic instances
- Presentation has sum-of-sides 10
- Infinite non-commutative monoid
- Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(a) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aa=a,babbb=ab b/a
abbbbbbb=ab
bab=abbbbb
aa=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
2 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 24700 | ⟨a, b | aa=a, baabbb=ab⟩ | φ(a) = a, φ(b) = b |
| 11 | 25241 | ⟨a, b | aa=a, babbb=aab⟩ | φ(a) = a, φ(b) = b |