Morphocompletion for #4010 ⟨a, b | aaabbaaab=aa⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabaaab ⇒ aaabbaa
2.	aaaaababb ⇒ aa
3.	aaabbaaa ⇒ aaaaabab
4.	aabaaaaabab ⇒ aaabbaabaaa
5.	aabaaaabbaa ⇒ aaaaababaab
6.	aaaaababaaab ⇒ aaaaabaabbaa
7.	aaaaababaabab ⇒ aabaaa
8.	aaaaabababbaa ⇒ aaaaab
9.	aabaaaaaabab ⇒ aaaaababaaba
10.	aaaaabaaaababb ⇒ aaaaaba
11.	aaaaabaabbaaa ⇒ aaaaabaaaabab
12.	aaaaababaaaababb ⇒ aaaaababa
	...

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] aaa, [3/1] aab, [3/2] aba, [3/3] baa, [3/4] bab, [3/5] abb, [3/6] bba
Length 4:	[4/0] aaaa, [4/1] aaba, [4/2] aaab, [4/3] abab, [4/4] baaa, [4/5] abaa, [4/6] babb
Length 5:	[5/0] aaaaa, [5/1] aabab, [5/2] aaaab, [5/3] aaaba, [5/4] aabaa, [5/5] abaaa, [5/6] ababb
Length 6:	[6/0] aaaaab, [6/1] aaaaba, [6/2] aaabab, [6/3] aabaaa, [6/4] aababb, [6/5] abaaaa, [6/6] abbaaa
Length 7:	[7/0] aaaaaba, [7/1] aaaabab, [7/2] aabaaaa, [7/3] aaababb, [7/4] aabbaaa, [7/5] aaabbaa, [7/6] aaababa

Considering [length 3 / frequency 0] aaa=c.

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

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