Morphocompletion for #3623 ⟨a, b | aabbaaaaab=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.	abaaaaab ⇒ aabbaaaa
2.	aaaaaababb ⇒ a
3.	aabbaaaaa ⇒ aaaaaabab
4.	aaaaaababababb ⇒ aabba
5.	aaaaaabababba ⇒ aaaaaabaababb
6.	aaaaaababaababb ⇒ aabbaa
7.	aaaaaababaaababb ⇒ aabbaaa
8.	aaaaaababababababb ⇒ aabbaabba
9.	aaaaaabaaaababba ⇒ aaaaaab
10.	aaaaaababaaaabab ⇒ abaaaaa
	...

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] aba, [3/2] bab, [3/3] aab, [3/4] abb, [3/5] baa, [3/6] bba
Length 4:	[4/0] aaaa, [4/1] abab, [4/2] aaab, [4/3] aaba, [4/4] babb, [4/5] baba, [4/6] abaa
Length 5:	[5/0] aaaaa, [5/1] aaaab, [5/2] aabab, [5/3] ababb, [5/4] aaaba, [5/5] ababa, [5/6] babab
Length 6:	[6/0] aaaaaa, [6/1] aaabab, [6/2] aaaaba, [6/3] aaaaab, [6/4] ababab, [6/5] aababb, [6/6] aababa
Length 7:	[7/0] aaaaaab, [7/1] aaaabab, [7/2] aaaaaba, [7/3] aaababa, [7/4] aaababb, [7/5] abababb, [7/6] abababa

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

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

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