#3679 ⟨a, b | aabbbbaaab=a⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 11
- Infinite non-commutative monoid
- Reduction order:
- Left-to-right recursive path with deg(b) = deg(c) = 0, b < c; deg(a) = 1
- Auxiliary generators:
- aaa=c
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
| # | Rule | Proof |
| 1. |
c2b4cb ⇒ cb4cbc |
[12] |
| 2. |
c2bcb4cb ⇒ c2b5cbc |
[17] |
| 3. |
(cb)3b3cb ⇒ cbcb5cbc |
[16] |
| 4. |
cb(bc)2b4cb ⇒ cb2cb5cbc |
[15] |
| 5. |
cb3cbcb4cb ⇒ cb3cb5cbc |
[13] |
| 6. |
(cb4cb)2 ⇒ c(b4cb)2c |
[10] |
| 7. |
c2b5cbcb4cb ⇒ cbcb5cbcb4c |
[20] |
| 8. |
cbcb5cbcb4cb ⇒ cb2cb5cbcb4c |
[19] |
| 9. |
cb2cb5cbcb4cb ⇒ cb3cb5cbcb4c |
[18] |
| 10. |
cb3cb5cbcb4cb ⇒ c(b4cb)2cb4c |
[14] |
| 11. |
c(b4cb)2cb4cb ⇒ c |
[11] |
| 12. |
a ⇒ c(b4cb)2 |
[9] |
# ab:aabbbbaaab=a bc/a aaa=c morph:3/0
ccbbbbcb=cbbbbcbc
ccbcbbbbcb=ccbbbbbcbc
cbcbcbbbbcb=cbcbbbbbcbc
cbbcbcbbbbcb=cbbcbbbbbcbc
cbbbcbcbbbbcb=cbbbcbbbbbcbc
cbbbbcbcbbbbcb=cbbbbcbbbbbcbc
ccbbbbbcbcbbbbcb=cbcbbbbbcbcbbbbc
cbcbbbbbcbcbbbbcb=cbbcbbbbbcbcbbbbc
cbbcbbbbbcbcbbbbcb=cbbbcbbbbbcbcbbbbc
cbbbcbbbbbcbcbbbbcb=cbbbbcbbbbbcbcbbbbc
cbbbbcbbbbbcbcbbbbcb=c
a=cbbbbcbbbbbcb