Morphocompletion for #3374 ⟨a, b | aaaabaabaa=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaaaba ⇒ abaaaa
2.	abaabaaaaa ⇒ a
3.	aabaaba ⇒ abaabaa
4.	abaababaaaaaaa ⇒ aaaba
5.	abaabaaabaaaa ⇒ aaba
6.	aababaabaa ⇒ abaabaaaba
7.	aaababaaba ⇒ abaababaaa
8.	abaabababaaaaaaa ⇒ aaababa
9.	abaababaaabaaaaaaa ⇒ aaabaaaba
10.	abaabaaababaaaa ⇒ aababa
11.	abaabaaabaaabaaaa ⇒ aabaaaba
12.	aabababaabaa ⇒ abaabaaababa
13.	aaabababaaba ⇒ abaabababaaa
14.	ababaabaaabaaabaaa ⇒ aababaaba
15.	abaababababaaaaaaa ⇒ aaabababa
16.	abaabaaabababaaaa ⇒ aabababa
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ab, [2/2] ba
Length 3:	[3/0] aba, [3/1] aaa, [3/2] baa, [3/3] aab, [3/4] bab
Length 4:	[4/0] abaa, [4/1] aaba, [4/2] aaaa, [4/3] baaa, [4/4] abab, [4/5] baba, [4/6] baab
Length 5:	[5/0] abaab, [5/1] abaaa, [5/2] ababa, [5/3] baaba, [5/4] aabaa, [5/5] aaaaa, [5/6] aaaba
Length 6:	[6/0] abaaba, [6/1] aabaaa, [6/2] abaaaa, [6/3] aababa, [6/4] ababaa, [6/5] aaaaaa, [6/6] baabaa
Length 7:	[7/0] abaabaa, [7/1] abaabab, [7/2] abaaaba, [7/3] aaaaaaa, [7/4] babaaba, [7/5] aabaaab, [7/6] babaaaa

Considering [length 5 / frequency 0] abaab=c.

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

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