| Up: | Monoids with two generators and two relations |
|---|---|
| Prev: | #1117 ⟨a, b | aa=1, ababb=b⟩ |
| Next: | #1121 ⟨a, b | aa=1, abbba=b⟩ |
| # | Rule | Proof |
|---|---|---|
| 1. | a2 ⇒ 1 | [1] |
| 2. | b3 ⇒ b | [5] |
| 3. | b2ab ⇒ ab | [3] |
# ab:aa=1,abbab=b ab aa=1 bbb=b bbab=ab
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
7 total
| Σ | # | Presentation | Mapping |
|---|---|---|---|
| 10 | 9683 | ⟨a, b | aa=1, aaabbab=b⟩ | φ(a) = a, φ(b) = b |
| 10 | 9723 | ⟨a, b | aa=1, abaabab=b⟩ | φ(a) = a, φ(b) = b |
| 10 | 9741 | ⟨a, b | aa=1, abbaaab=b⟩ | φ(a) = a, φ(b) = b |
| 10 | 9975 | ⟨a, b | aa=1, aabbab=ab⟩ | φ(a) = a, φ(b) = b |
| 10 | 10036 | ⟨a, b | aa=1, baabab=ab⟩ | φ(a) = a, φ(b) = b |
| 10 | 10283 | ⟨a, b | aa=1, abbab=aab⟩ | φ(a) = a, φ(b) = b |
| 10 | 10286 | ⟨a, b | aa=1, abbab=baa⟩ | φ(a) = a, φ(b) = b |
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
8 total
| Σ | # | Presentation | Mapping |
|---|---|---|---|
| 8 | 1199 | ⟨a, b | aa=1, babb=ba⟩ | φ(a) = a, φ(b) = b |
| 10 | 9699 | ⟨a, b | aa=1, aababba=b⟩ | φ(a) = a, φ(b) = b |
| 10 | 9969 | ⟨a, b | aa=1, aababb=ba⟩ | φ(a) = a, φ(b) = b |
| 10 | 10002 | ⟨a, b | aa=1, ababba=ab⟩ | φ(a) = a, φ(b) = b |
| 10 | 10033 | ⟨a, b | aa=1, baaabb=ba⟩ | φ(a) = a, φ(b) = b |
| 10 | 10276 | ⟨a, b | aa=1, ababb=aba⟩ | φ(a) = a, φ(b) = b |
| 10 | 10514 | ⟨a, b | aa=1, babb=aaba⟩ | φ(a) = a, φ(b) = b |
| 10 | 10520 | ⟨a, b | aa=1, babb=baaa⟩ | φ(a) = a, φ(b) = b |