| Up: | Monoid enumeration |
|---|---|
| Prev: | #4365 ⟨a, b, c | aab=1, cccc=c⟩ |
| Next: | #4375 ⟨a, b, c | aba=1, aabc=c⟩ |
| # | Rule | Proof |
|---|---|---|
| 1. | ba ⇒ ab | [3] |
| 2. | bc ⇒ ac | [4] |
| 3. | a2b ⇒ 1 | [5] |
| 4. | a3c ⇒ c | [2] |
# abc:aba=1,aaac=c abc - - ba=ab bc=ac aab=1 aaac=c
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
3 total
| Σ | # | Presentation | Mapping |
|---|---|---|---|
| 8 | 4393 | ⟨a, b, c | aba=1, abbc=c⟩ | φ(a) = a, φ(b) = b, φ(c) = c |
| 8 | 4431 | ⟨a, b, c | aba=1, babc=c⟩ | φ(a) = a, φ(b) = b, φ(c) = c |
| 8 | 4440 | ⟨a, b, c | aba=1, bbac=c⟩ | φ(a) = a, φ(b) = b, φ(c) = c |