#6464 ⟨a, b | aba=a, ababa=a⟩
Quick links
- Properties
- Rewriting system
- Isomorphic instances
- Presentation has sum-of-sides 10
- Infinite non-commutative monoid
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
| # | Rule | Proof |
| 1. |
aba ⇒ a |
[1] |
# ab:aba=a,ababa=a ab
aba=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
2 total
| Σ | # | Presentation | Mapping |
| 10 | 6733 | ⟨a, b | aba=a, aaba=aa⟩ | φ(a) = a, φ(b) = b |
| 10 | 6742 | ⟨a, b | aba=a, abab=ab⟩ | φ(a) = a, φ(b) = b |