| Back: | ⟨a, b | abaabaaab=1⟩ |
|---|
Solved by morph:3/0. (See Morphocompletion.)
Checking up to 20 rules for overlaps.
Rewriting system is not complete: rulesLimit
| # | Rule |
|---|---|
| 1. | abaaab ⇒ baabaa |
| 2. | aabbaa ⇒ baaaab |
| 3. | aabab ⇒ baaba |
| 4. | aaaabbaa ⇒ aabaaaab |
| 5. | babaabaaa ⇒ 1 |
| ... |
Collecting factors up to length 8, frequency 7:
| Length 2: | [2/0] aa, [2/1] ab, [2/2] ba, [2/3] bb |
|---|---|
| Length 3: | [3/0] aab, [3/1] baa, [3/2] aaa, [3/3] aba, [3/4] bab, [3/5] abb, [3/6] bba |
| Length 4: | [4/0] bbaa, [4/1] abaa, [4/2] aabb, [4/3] aaab, [4/4] aaba, [4/5] baaa, [4/6] abab |
| Length 5: | [5/0] abbaa, [5/1] abaaa, [5/2] aabba, [5/3] baaab, [5/4] babaa, [5/5] aaaab, [5/6] aaabb |
| Length 6: | [6/0] babaab, [6/1] aaaabb, [6/2] aabbaa, [6/3] aabaaa, [6/4] aaabba, [6/5] abaaba, [6/6] baabaa |
| Length 7: | [7/0] babaaba, [7/1] aaaabba, [7/2] aaabbaa, [7/3] baabaaa, [7/4] abaabaa, [7/5] abaaaab, [7/6] aabaaaa |
Considering [length 3 / frequency 0] aab=c.
Rewriting system is complete. See ⟨a, b | abaabaaab=1⟩.