| Up: | Monoid enumeration |
|---|---|
| Prev: | #4898 ⟨a, b, c | ab=a, bccbc=1⟩ |
| Next: | #4901 ⟨a, b, c | ab=a, bcccc=1⟩ |
| # | Rule | Proof |
|---|---|---|
| 1. | ad ⇒ a | [7] |
| 2. | ab ⇒ a | [1] |
| 3. | bd ⇒ db | [6] |
| 4. | cd ⇒ dc | [9] |
| 5. | db2 ⇒ 1 | [8] |
| 6. | cb2 ⇒ b2c | [12] |
| 7. | c3 ⇒ d | [3] |
# abc:ab=a,bcccb=1 adbc ccc=d morph:3/0 ad=a ab=a bd=db cd=dc dbb=1 cbb=bbc ccc=d
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
2 total
| Σ | # | Presentation | Mapping |
|---|---|---|---|
| 8 | 4946 | ⟨a, b, c | ab=a, cbbcc=1⟩ | φ(a) = a, φ(b) = b, φ(c) = c |
| 8 | 4970 | ⟨a, b, c | ab=a, ccbbc=1⟩ | φ(a) = a, φ(b) = b, φ(c) = c |