| Up: | Monoid enumeration |
|---|---|
| Prev: | #6152 ⟨a, b, c | aa=1, abacbc=1⟩ |
| Next: | #6155 ⟨a, b, c | aa=1, abaccc=1⟩ |
| # | Rule | Proof |
|---|---|---|
| 1. | a2 ⇒ 1 | [1] |
| 2. | bad ⇒ dba | [8] |
| 3. | dbab ⇒ a | [9] |
| 4. | cd ⇒ dc | [5] |
| 5. | cbab ⇒ (ba)2ca | [12] |
| 6. | c2 ⇒ d | [3] |
# abc:aa=1,abaccb=1 reversed:bad/c cc=d morph:2/0 aa=1 bad=dba dbab=a cd=dc cbab=babaca cc=d
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
|---|---|---|---|
| 8 | 6732 | ⟨a, b, c | aa=1, baccb=a⟩ | φ(a) = a, φ(b) = b, φ(c) = c |