| Back: | ⟨a, b | abaaaaabaab=1⟩ |
|---|
Solved by morph:3/0. (See Morphocompletion.)
Checking up to 20 rules for overlaps.
Rewriting system is not complete: rulesLimit
| # | Rule |
|---|---|
| 1. | baaaaaba ⇒ aaaabaab |
| 2. | ababaaa ⇒ baaaaab |
| 3. | babaaaa ⇒ aaabaab |
| 4. | aaaaabaabab ⇒ 1 |
| 5. | baababa ⇒ abaabab |
| 6. | aaabaabaabaabab ⇒ baba |
| 7. | aaabaabaaabaabab ⇒ babaa |
| ... |
Collecting factors up to length 8, frequency 7:
| Length 2: | [2/0] aa, [2/1] ba, [2/2] ab |
|---|---|
| Length 3: | [3/0] aba, [3/1] aaa, [3/2] baa, [3/3] aab, [3/4] bab |
| Length 4: | [4/0] aaba, [4/1] abab, [4/2] abaa, [4/3] baab, [4/4] aaab, [4/5] aaaa, [4/6] baaa |
| Length 5: | [5/0] baaba, [5/1] aaaba, [5/2] aabab, [5/3] aabaa, [5/4] abaab, [5/5] ababa, [5/6] baaaa |
| Length 6: | [6/0] baabab, [6/1] abaaba, [6/2] aabaab, [6/3] aaabaa, [6/4] babaaa, [6/5] baabaa, [6/6] aaaaba |
| Length 7: | [7/0] abaabab, [7/1] aabaaba, [7/2] aaabaab, [7/3] aaaaaba, [7/4] abaabaa, [7/5] baabaab, [7/6] baaaaab |
Considering [length 3 / frequency 0] aba=c.
Rewriting system is complete. See ⟨a, b | abaaaaabaab=1⟩.