| Up: | Monoids with two generators and one relation |
|---|---|
| Prev: | #289 ⟨a, b | aaababab=1⟩ |
| Next: | #291 ⟨a, b | aaababbb=1⟩ |
| # | Rule | Proof |
|---|---|---|
| 1. | dc ⇒ 1 | [12] |
| 2. | cd ⇒ 1 | [8] |
| 3. | ca ⇒ ac | [5] |
| 4. | da ⇒ ad | [11] |
| 5. | a4 ⇒ c | [2] |
| 6. | b2c ⇒ a3bab | [16] |
| 7. | babd ⇒ adb2 | [13] |
| 8. | bcba ⇒ cbab | [19] |
| 9. | b2ac ⇒ a3(ba)2 | [18] |
| 10. | (ba)2d ⇒ adb2a | [14] |
| 11. | b2a2c ⇒ a3baba2 | [22] |
| 12. | baba2d ⇒ adb2a2 | [21] |
| 13. | b2a3 ⇒ a3dbcb | [25] |
| 14. | baba3 ⇒ d(bc)2 | [23] |
| 15. | bab2 ⇒ d | [3] |
# ab:aaababba=1 reversed:cda/b aaaa=c,babb=d magic:0 dc=1 cd=1 ca=ac da=ad aaaa=c bbc=aaabab babd=adbb bcba=cbab bbac=aaababa babad=adbba bbaac=aaababaa babaad=adbbaa bbaaa=aaadbcb babaaa=dbcbc babb=d
| Σ | # | Presentation | Description | Related |
|---|---|---|---|---|
| 7 | 254 | ⟨a, b | aaba=bbb⟩ | Infinite cancellative non-commutative monoid | |
| 8 | 478 | ⟨a, b | ababba=bb⟩ | Infinite cancellative non-commutative monoid | |
| 9 | 863 | ⟨a, b | abbabbba=b⟩ | Infinite cancellative non-commutative monoid | |
| 9 | 1263 | ⟨a, b | ababa=babb⟩ | Infinite cancellative non-commutative monoid | |
| 11 | 4796 | ⟨a, b | abaababa=bab⟩ | Infinite cancellative non-commutative monoid | |
| 11 | 5405 | ⟨a, b | abbabba=babb⟩ | Infinite cancellative non-commutative monoid |
| Σ | # | Presentation | Description | Related |
|---|---|---|---|---|
| 7 | 186 | ⟨a, b | aabbba=b⟩ | Infinite cancellative non-commutative monoid | |
| 9 | 804 | ⟨a, b | aabababa=b⟩ | Infinite cancellative non-commutative monoid | |
| 11 | 3560 | ⟨a, b | aabaabaaba=b⟩ | Infinite cancellative non-commutative monoid |
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
9 total
| Σ | # | Presentation | Mapping |
|---|---|---|---|
| 8 | 308 | ⟨a, b | aababbaa=1⟩ | φ(a) = a, φ(b) = aaadab |
| 8 | 335 | ⟨a, b | abbaaaab=1⟩ | φ(a) = a, φ(b) = aaadab |
| 10 | 1366 | ⟨a, b | aaabbaaaba=1⟩ | φ(a) = aaad, φ(b) = aaaba |
| 10 | 1396 | ⟨a, b | aabaaaabba=1⟩ | φ(a) = aaad, φ(b) = aaaba |
| 10 | 1544 | ⟨a, b | abbbabbbba=1⟩ | φ(a) = aabaa, φ(b) = aaad |
| 11 | 2849 | ⟨a, b | aaaabaababa=1⟩ | φ(a) = a, φ(b) = aaadabaaad |
| 11 | 2916 | ⟨a, b | aaabaababaa=1⟩ | φ(a) = a, φ(b) = aaadabaaad |
| 11 | 3052 | ⟨a, b | aababaaaaab=1⟩ | φ(a) = a, φ(b) = aaadaaadab |
| 11 | 3173 | ⟨a, b | abaaaaabaab=1⟩ | φ(a) = a, φ(b) = aaadaaadab |
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
10 total
| Σ | # | Presentation | Mapping |
|---|---|---|---|
| 8 | 294 | ⟨a, b | aaabbaba=1⟩ | φ(a) = a, φ(b) = aaadab |
| 8 | 334 | ⟨a, b | ababbbba=1⟩ | φ(a) = aaadab, φ(b) = a |
| 10 | 1342 | ⟨a, b | aaabaaabba=1⟩ | φ(a) = aaad, φ(b) = aabaa |
| 10 | 1365 | ⟨a, b | aaabbaaaab=1⟩ | φ(a) = aaad, φ(b) = aaaab |
| 10 | 1400 | ⟨a, b | aabaaabbaa=1⟩ | φ(a) = aaad, φ(b) = aabaa |
| 10 | 1438 | ⟨a, b | aabbaaaaba=1⟩ | φ(a) = aaad, φ(b) = aabaa |
| 11 | 2857 | ⟨a, b | aaaababaaba=1⟩ | φ(a) = a, φ(b) = aaadabaaad |
| 11 | 2930 | ⟨a, b | aaababaabaa=1⟩ | φ(a) = a, φ(b) = aaadabaaad |
| 11 | 3174 | ⟨a, b | abaaaaababa=1⟩ | φ(a) = a, φ(b) = aaadabaaad |
| 11 | 3200 | ⟨a, b | abaabaaaaab=1⟩ | φ(a) = a, φ(b) = aaadaaadab |