#15455 ⟨a, b | aaa=ab, aabbb=a⟩
Quick links
- Properties
- Rewriting system
- Isomorphic instances
- Presentation has sum-of-sides 11
- Infinite non-commutative monoid
- Reduction order:
- Left-to-right recursive path with deg(a) = 0; deg(b) = 1
- Certificate: derivations of all rewriting rules from the defining relations.
# ab:aaa=ab,aabbb=a a/b
aaaaaaaa=a
ab=aaa
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
3 total
| Σ | # | Presentation | Mapping |
|---|
| 11 | 15463 | ⟨a, b | aaa=ab, ababb=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 15467 | ⟨a, b | aaa=ab, abbab=a⟩ | φ(a) = a, φ(b) = b |
| 11 | 15469 | ⟨a, b | aaa=ab, abbba=a⟩ | φ(a) = a, φ(b) = b |