| Up: | Monoids with two generators and two relations |
|---|---|
| Prev: | #3399 ⟨a, b | aa=1, babbab=b⟩ |
| Next: | #3405 ⟨a, b | aa=1, bbabbb=b⟩ |
| # | Rule | Proof |
|---|---|---|
| 1. | a2 ⇒ 1 | [1] |
| 2. | bab4 ⇒ b | [2] |
# ab:aa=1,babbbb=b ab aa=1 babbbb=b
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
7 total
| Σ | # | Presentation | Mapping |
|---|---|---|---|
| 11 | 26529 | ⟨a, b | aa=1, aababbbb=b⟩ | φ(a) = a, φ(b) = b |
| 11 | 26655 | ⟨a, b | aa=1, baaabbbb=b⟩ | φ(a) = a, φ(b) = b |
| 11 | 26675 | ⟨a, b | aa=1, babaabbb=b⟩ | φ(a) = a, φ(b) = b |
| 11 | 26683 | ⟨a, b | aa=1, babbaabb=b⟩ | φ(a) = a, φ(b) = b |
| 11 | 27127 | ⟨a, b | aa=1, ababbbb=ab⟩ | φ(a) = a, φ(b) = b |
| 11 | 27741 | ⟨a, b | aa=1, babbbb=aab⟩ | φ(a) = a, φ(b) = b |
| 11 | 27744 | ⟨a, b | aa=1, babbbb=baa⟩ | φ(a) = a, φ(b) = b |
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
3 total
| Σ | # | Presentation | Mapping |
|---|---|---|---|
| 11 | 26551 | ⟨a, b | aa=1, aabbbbab=b⟩ | φ(a) = a, φ(b) = b |
| 11 | 26667 | ⟨a, b | aa=1, baabbbab=b⟩ | φ(a) = a, φ(b) = b |
| 11 | 27158 | ⟨a, b | aa=1, abbbbab=ab⟩ | φ(a) = a, φ(b) = b |