Morphocompletion for #4351 ⟨a, b | abbbaaaab=aa⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	aabbaaaab ⇒ abbbaaaaa
2.	abbbaaaab ⇒ aa
3.	aaaaaababbaaaab ⇒ aaaaaabbbbaaaaa
4.	aabbaaabbbaaaaa ⇒ abbbaaaaabaaaab
5.	aaaaaabbbbaaaab ⇒ aaaaaaba
6.	abbbaaabbbaaaaa ⇒ aabaaaab
7.	aabaaaabbbbaaaab ⇒ aabaaaaba
8.	aaaaaababbbbaaaab ⇒ aaaaaababa
9.	aabaaaababbbbaaaab ⇒ aabaaaababa
10.	aabaaaabaabbbbaaaab ⇒ aabaaaabaaba
	...

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] aaa, [3/1] aab, [3/2] baa, [3/3] bbb, [3/4] abb, [3/5] bba, [3/6] aba
Length 4:	[4/0] aaaa, [4/1] aaab, [4/2] baaa, [4/3] bbaa, [4/4] abbb, [4/5] aaba, [4/6] bbba
Length 5:	[5/0] aaaab, [5/1] baaaa, [5/2] aaaaa, [5/3] bbaaa, [5/4] bbbaa, [5/5] aabaa, [5/6] abbba
Length 6:	[6/0] baaaab, [6/1] bbaaaa, [6/2] bbbaaa, [6/3] abbbaa, [6/4] aabaaa, [6/5] aaaaaa, [6/6] abbbba
Length 7:	[7/0] bbaaaab, [7/1] bbbaaaa, [7/2] abbbaaa, [7/3] aaaaaab, [7/4] aabaaaa, [7/5] abbbbaa, [7/6] bbbbaaa

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

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

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