| Back: | ⟨a, b | aaabba=baaa⟩ |
|---|
Solved by morph:3/2,2/1,3/2,3/0. (See Morphocompletion.)
Checking up to 20 rules for overlaps.
Rewriting system is not complete: rulesLimit
| # | Rule |
|---|---|
| 1. | aaabba ⇒ baaa |
| 2. | aaabbbaaa ⇒ baabaaa |
| 3. | aaabbbbaaa ⇒ baabbaaa |
| 4. | aaabbbabaaa ⇒ baababaaa |
| 5. | aaabbbbbaaa ⇒ baabbbaaa |
| ... |
Collecting factors up to length 4 / frequency 3:
| [2/0] | aa | 27 | lf:18,lp:5,ls:4,rf:14,rs:5,lprs:5,lsrs:4 |
|---|---|---|---|
| [2/1] | bb | 12 | lf:12,rf:3 |
| [2/2] | ba | 7 | lf:6,ls:1,rf:10,rp:5,lsrp:1 |
| [3/0] | aaa | 18 | lf:9,lp:5,ls:4,rf:5,rs:5,lprs:5,lsrs:4 |
| [3/1] | bbb | 7 | lf:7,rf:1,a:1 |
| [3/2] | bba | 6 | lf:5,ls:1,rf:2 |
Considering [length 3 / frequency 2] bba=c.
Checking up to 20 rules for overlaps.
Rewriting system is not complete: pendingRulesLimit
| # | Rule |
|---|---|
| 1. | baaa ⇒ aaac |
| 2. | aaacc ⇒ caa |
| 3. | bcaa ⇒ caac |
| 4. | bba ⇒ c |
| 5. | aaacacc ⇒ bacaa |
| 6. | aaacaacc ⇒ baacaa |
| 7. | baabacaa ⇒ aaabccaa |
| 8. | aaacacacc ⇒ babacaa |
| 9. | caacacc ⇒ bccaa |
| 10. | caacaacc ⇒ bcacaa |
| 11. | aaacbccaa ⇒ cabacaa |
| 12. | aaabbccaa ⇒ baaccaa |
| 13. | caaccacc ⇒ bbccaa |
| ... |
Collecting factors up to length 5 / frequency 3:
| [2/0] | aa | 35 | lf:24,lp:6,ls:5,rf:17,rp:2,rs:10,lsrp:2,lprs:6,lsrs:3,a:2 |
|---|---|---|---|
| [2/1] | cc | 17 | lf:10,ls:7,rf:4,a:3 |
| [2/2] | ca | 17 | lf:14,lp:3,rf:13,rp:3,a:3 |
| [3/0] | caa | 16 | lf:9,lp:3,ls:4,rf:11,rp:2,rs:10,re:1,lsrp:10,lprs:3,lsrs:3,a:3 |
| [3/1] | acc | 15 | lf:8,ls:7,rf:1,a:3 |
| [3/2] | aaa | 14 | lf:7,lp:6,ls:1,rf:2,rp:2,lsrp:10,a:2 |
| [4/0] | aaac | 10 | lf:5,lp:5,rf:1,rp:1,rs:1,re:1,a:2 |
| [4/1] | cacc | 8 | lf:4,ls:4,a:6 |
| [4/2] | caac | 8 | lf:5,lp:3,rf:1,rp:1,rs:1,re:1,a:5 |
Considering [length 2 / frequency 1] cc=d.
Checking up to 20 rules for overlaps.
Rewriting system is not complete: roundsLimit
| # | Rule |
|---|---|
| 1. | caa ⇒ aaad |
| 2. | baaa ⇒ aaac |
| 3. | aaadad ⇒ daa |
| 4. | cdaa ⇒ daaad |
| 5. | dc ⇒ cd |
| 6. | cc ⇒ d |
| 7. | bba ⇒ c |
| 8. | aaadaadad ⇒ cadaa |
| 9. | aaacdad ⇒ bdaa |
| 10. | aaacadad ⇒ badaa |
| 11. | cddaa ⇒ ddaaad |
| 12. | aaadacd ⇒ daac |
| 13. | cbdaa ⇒ daacad |
| 14. | bbdaa ⇒ aaaddad |
| 15. | cdddaa ⇒ dddaaad |
| 16. | aaacacdad ⇒ babdaa |
| 17. | aaacdacd ⇒ bdaac |
| 18. | aaacadacd ⇒ badaac |
| 19. | cdbdaa ⇒ ddaacad |
| 20. | cddddaa ⇒ ddddaaad |
| ... |
Collecting factors up to length 4 / frequency 3:
| [2/0] | aa | 44 | lf:27,lp:8,ls:9,rf:24,rp:3,rs:5,lsrp:3,lprs:5,a:3 |
|---|---|---|---|
| [2/1] | cd | 19 | lf:11,lp:5,ls:3,rf:1,rp:1,rs:1,re:1,a:4 |
| [2/2] | da | 16 | lf:16,rf:15,rp:4,a:6 |
| [3/0] | aaa | 18 | lf:9,lp:8,ls:1,rf:7,rp:3,lsrp:10,a:3 |
| [3/1] | daa | 15 | lf:8,ls:7,rf:14,rp:4,rs:5,re:1,lsrp:2,a:6 |
| [3/2] | dad | 10 | lf:5,ls:5,rf:1,rs:1,a:6 |
Considering [length 3 / frequency 2] dad=e.
Checking up to 20 rules for overlaps.
Rewriting system is not complete: roundsLimit
| # | Rule |
|---|---|
| 1. | aaaeaae ⇒ eaa |
| 2. | daa ⇒ aaae |
| 3. | dae ⇒ ead |
| 4. | deaa ⇒ aaaeaeaae |
| 5. | deeaa ⇒ aaaeaeaaeaeaae |
| 6. | deaeaa ⇒ aaaeaeaaeaaeaae |
| 7. | caa ⇒ aaad |
| 8. | ceaa ⇒ aaaeaaaaee |
| 9. | caeaa ⇒ aaaaaaeeaae |
| 10. | ceeaa ⇒ aaaeaaaaeeaeaae |
| 11. | baaa ⇒ aaac |
| 12. | beaa ⇒ aaaaaaeaaaaeee |
| 13. | baeaa ⇒ aaaaaaaaaeeaaee |
| 14. | baaeaa ⇒ aaaaaaaaaeaeaaee |
| 15. | dad ⇒ e |
| 16. | dc ⇒ cd |
| 17. | dace ⇒ ecad |
| 18. | cc ⇒ d |
| 19. | bba ⇒ c |
| 20. | dacd ⇒ ec |
| ... |
Collecting factors up to length 7 / frequency 2:
| [2/0] | aa | 30 | lf:17,lp:1,ls:12,rf:62,rp:12,rs:1,lsrp:12,lprs:1,a:4 |
|---|---|---|---|
| [2/1] | ea | 11 | lf:11,rf:21,rp:2,a:6 |
| [3/0] | eaa | 19 | lf:10,ls:9,rf:14,rp:1,rs:1,re:1,a:11 |
| [3/1] | aea | 5 | lf:5,rf:16,a:11 |
| [4/0] | aeaa | 9 | lf:5,ls:4,rf:11,a:11 |
| [4/1] | eeaa | 4 | lf:2,ls:2,rf:2,a:14 |
| [5/0] | aaeaa | 3 | lf:2,ls:1,rf:5,a:11 |
| [5/1] | baaea | 2 | lf:1,lp:1,a:15 |
| [6/0] | aaeaae | 2 | lf:1,ls:1,rf:2,rs:1,a:11 |
| [6/1] | aaaeaa | 2 | lf:1,lp:1,rf:3,rp:2,a:11 |
Considering [length 3 / frequency 0] eaa=f.
Rewriting system is complete. See ⟨a, b | aaabba=baaa⟩.