| Back: | ⟨a, b | aabaaababaa=1⟩ |
|---|
Solved by morph:3/0. (See Morphocompletion.)
Checking up to 20 rules for overlaps.
Rewriting system is not complete: rulesLimit
| # | Rule |
|---|---|
| 1. | aaaabaaabab ⇒ 1 |
| 2. | baaababa ⇒ abaaabab |
| 3. | aaabaaababbaba ⇒ baaabaabaaabab |
| 4. | aaabaaababbaabaaabab ⇒ baaabbaba |
| 5. | aaabaaababbaaabaaabab ⇒ baaabbabaa |
| ... |
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] aba, [3/1] aaa, [3/2] aab, [3/3] bab, [3/4] baa, [3/5] bba, [3/6] abb |
| Length 4: | [4/0] aaab, [4/1] aaba, [4/2] abab, [4/3] baaa, [4/4] abaa, [4/5] baba, [4/6] babb |
| Length 5: | [5/0] aaaba, [5/1] aabab, [5/2] baaab, [5/3] abaaa, [5/4] aabaa, [5/5] babba, [5/6] ababb |
| Length 6: | [6/0] aaabab, [6/1] baaaba, [6/2] aaabaa, [6/3] abaaab, [6/4] aabaaa, [6/5] ababba, [6/6] aababb |
| Length 7: | [7/0] baaabab, [7/1] aaabaaa, [7/2] abaaaba, [7/3] aabaaab, [7/4] aababba, [7/5] aaababb, [7/6] babbaba |
Considering [length 3 / frequency 0] aba=c.
Rewriting system is complete. See ⟨a, b | aabaaababaa=1⟩.