| Up: | Monoids with two generators and one relation |
|---|---|
| Prev: | #644 ⟨a, b | aaabbabab=1⟩ |
| Next: | #647 ⟨a, b | aaabbbaab=1⟩ |
| # | Rule | Proof |
|---|---|---|
| 1. | ad ⇒ da | [10] |
| 2. | da3 ⇒ 1 | [11] |
| 3. | cd ⇒ dc | [12] |
| 4. | ca3 ⇒ a3c | [18] |
| 5. | cac ⇒ d2a2 | [15] |
| 6. | cb ⇒ bc | [5] |
| 7. | cab ⇒ d2a2ba4ca | [20] |
| 8. | b2 ⇒ c | [2] |
# ab:aaabbabba=1 reversed:ad/cb bb=c,acac=d morph:2/0,4/0 ad=da daaa=1 cd=dc caaa=aaac cac=ddaa cb=bc cab=ddaabaaaaca bb=c
| Σ | # | Presentation | Description | Related |
|---|---|---|---|---|
| 9 | 1116 | ⟨a, b | abaaba=bbb⟩ | Infinite cancellative non-commutative monoid | |
| 11 | 4262 | ⟨a, b | abaabaaba=bb⟩ | Infinite cancellative non-commutative monoid | |
| 11 | 4346 | ⟨a, b | abbababba=bb⟩ | Infinite cancellative non-commutative monoid |
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
8 total
| Σ | # | Presentation | Mapping |
|---|---|---|---|
| 9 | 683 | ⟨a, b | aabbabbaa=1⟩ | φ(a) = a, φ(b) = b |
| 9 | 690 | ⟨a, b | aabbbbaab=1⟩ | φ(a) = b, φ(b) = a |
| 9 | 709 | ⟨a, b | abaabbbba=1⟩ | φ(a) = b, φ(b) = a |
| 11 | 3047 | ⟨a, b | aabaabbbaab=1⟩ | φ(a) = baaaaca, φ(b) = bba |
| 11 | 3128 | ⟨a, b | aabbabbabba=1⟩ | φ(a) = bab, φ(b) = baaaaca |
| 11 | 3139 | ⟨a, b | aabbbaabaab=1⟩ | φ(a) = baaaaca, φ(b) = bba |
| 11 | 3206 | ⟨a, b | abaabaabbba=1⟩ | φ(a) = baaaaca, φ(b) = bab |
| 11 | 3221 | ⟨a, b | abaabbbaaba=1⟩ | φ(a) = baaaaca, φ(b) = bab |