Morphocompletion for #3345 ⟨a, b | aaaaababaa=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaaaaaba ⇒ abaaaaaa
2.	ababaaaaaa ⇒ a
3.	aababa ⇒ ababaa
4.	ababaabaaaaaa ⇒ aaba
5.	ababaaabaaaaaa ⇒ aaaba
6.	ababaaaabaaaaaa ⇒ aaaaba
7.	ababaaaaabaaaaaa ⇒ aaaaaba
8.	ababaabaabaaaaaa ⇒ aabaaba
9.	ababaabaaabaaaaaa ⇒ aabaaaba
10.	ababaabaaaabaaaaaa ⇒ aabaaaaba
11.	ababaaabaabaaaaaa ⇒ aaabaaba
12.	ababaaabaaabaaaaaa ⇒ aaabaaaba
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ab, [2/2] ba
Length 3:	[3/0] aaa, [3/1] aba, [3/2] baa, [3/3] aab, [3/4] bab
Length 4:	[4/0] aaaa, [4/1] abaa, [4/2] abab, [4/3] aaba, [4/4] baaa, [4/5] baba, [4/6] aaab
Length 5:	[5/0] aaaaa, [5/1] ababa, [5/2] abaaa, [5/3] aabaa, [5/4] baaaa, [5/5] babaa, [5/6] aaaba
Length 6:	[6/0] aaaaaa, [6/1] ababaa, [6/2] abaaaa, [6/3] aabaaa, [6/4] baaaaa, [6/5] aaabaa, [6/6] abaaba
Length 7:	[7/0] baaaaaa, [7/1] ababaaa, [7/2] abaaaaa, [7/3] aabaaaa, [7/4] ababaab, [7/5] aaabaaa, [7/6] abaabaa

Considering [length 6 / frequency 0] aaaaaa=c.

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

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