Morphocompletion for #2085 ⟨a, b | abbbaaab=aa⟩

Solved by morph:3/3. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabbaaab ⇒ abbbaaaa
2.	abbbaaab ⇒ aa
3.	aaaaababbaaab ⇒ aaaaabbbbaaaa
4.	aabbaabbbaaaa ⇒ abbbaaaabaaab
5.	aabaaababbaaab ⇒ aabaaabbbbaaaa
6.	aaaaabbbbaaab ⇒ aaaaaba
7.	abbbaabbbaaaa ⇒ aabaaab
8.	aabaaabbbbaaab ⇒ aabaaaba
9.	aaaaababbbbaaab ⇒ aaaaababa
10.	aaaaabaabbbbaaab ⇒ aaaaabaaba
11.	aabaaababbbbaaab ⇒ aabaaababa
12.	aabaaabaabbbbaaab ⇒ aabaaabaaba
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ab, [2/2] bb, [2/3] ba
Length 3:	[3/0] aab, [3/1] aaa, [3/2] baa, [3/3] bbb, [3/4] abb, [3/5] bba, [3/6] aba
Length 4:	[4/0] aaab, [4/1] baaa, [4/2] aaaa, [4/3] bbaa, [4/4] aaba, [4/5] abbb, [4/6] bbba
Length 5:	[5/0] baaab, [5/1] bbaaa, [5/2] bbbaa, [5/3] aabaa, [5/4] aaaaa, [5/5] abbbb, [5/6] bbbba
Length 6:	[6/0] bbaaab, [6/1] bbbaaa, [6/2] aaaaab, [6/3] aabaaa, [6/4] abbbba, [6/5] bbbbaa, [6/6] abbbaa
Length 7:	[7/0] bbbaaab, [7/1] aabaaab, [7/2] abbbbaa, [7/3] bbbbaaa, [7/4] abbaaab, [7/5] aaaaaba, [7/6] aabbbba

Considering [length 3 / frequency 3] bbb=c.

Auxiliary generators:
1. c = bbb
Reduction order:
- Left-to-right recursive path with deg(c) = deg(a) = 0, c < a; deg(b) = 1

Rewriting system is complete. See ⟨a, b | abbbaaab=aa⟩.