| Back: | ⟨a, b | aabbabaab=a⟩ |
|---|
Solved by morph:5/0,2/0. (See Morphocompletion.)
Checking up to 20 rules for overlaps.
Rewriting system is not complete: rulesLimit
| # | Rule |
|---|---|
| 1. | ababaab ⇒ aabbaba |
| 2. | aaabab ⇒ ababaa |
| 3. | aabbabaab ⇒ a |
| 4. | aabaabab ⇒ aabbabaa |
| 5. | ababaaaab ⇒ aaaabbaba |
| 6. | ababaaabbaba ⇒ aaab |
| 7. | aabbabaaaab ⇒ aabaaabbaba |
| 8. | ababaaabaab ⇒ aaabaabbaba |
| 9. | aabbabaaabbaba ⇒ aabaab |
| 10. | ababaaaaaab ⇒ aaaaaabbaba |
| 11. | ababaaaaabbaba ⇒ aaaaab |
| ... |
Collecting factors up to length 7, frequency 4:
| Length 2: | [2/0] ab, [2/1] aa, [2/2] ba, [2/3] bb |
|---|---|
| Length 3: | [3/0] aba, [3/1] aab, [3/2] aaa, [3/3] bab |
| Length 4: | [4/0] abab, [4/1] baba, [4/2] aaab, [4/3] abaa |
| Length 5: | [5/0] ababa, [5/1] aabba, [5/2] babaa, [5/3] bbaba |
| Length 6: | [6/0] ababaa, [6/1] aabbab, [6/2] abbaba, [6/3] babaaa |
Considering [length 5 / frequency 0] ababa=c.
Checking up to 20 rules for overlaps.
Rewriting system is not complete: roundsLimit
| # | Rule |
|---|---|
| 1. | cba ⇒ abc |
| 2. | aa ⇒ cc |
| 3. | aac ⇒ ccc |
| 4. | aabc ⇒ ccbc |
| 5. | cca ⇒ acc |
| 6. | abca ⇒ cbcc |
| 7. | cabba ⇒ ccbbc |
| 8. | cabab ⇒ a |
| 9. | aaba ⇒ cabc |
| 10. | ababa ⇒ c |
| 11. | ababcc ⇒ ca |
| 12. | ccac ⇒ accc |
| 13. | ccabc ⇒ accbc |
| 14. | cbcabcb ⇒ aba |
| 15. | abcac ⇒ cbccc |
| 16. | acabcb ⇒ ca |
| 17. | ccbca ⇒ acbcc |
| 18. | ccbbaba ⇒ cab |
| ... |
Collecting factors up to length 6, frequency 7:
| Length 2: | [2/0] ab, [2/1] ca, [2/2] ba, [2/3] cc, [2/4] bc, [2/5] cb, [2/6] ac |
|---|---|
| Length 3: | [3/0] aba, [3/1] abc, [3/2] cab, [3/3] bca, [3/4] bab, [3/5] cca, [3/6] cac |
| Length 4: | [4/0] abab, [4/1] cbca, [4/2] cabc, [4/3] baba, [4/4] abcb, [4/5] caba, [4/6] acab |
| Length 5: | [5/0] cabcb, [5/1] acabc, [5/2] cbcab, [5/3] ccbba, [5/4] ababc, [5/5] babcc, [5/6] bbaba |
Considering [length 2 / frequency 0] ab=d.
Rewriting system is complete. See ⟨a, b | aabbabaab=a⟩.