Morphocompletion for #3563 ⟨a, b | aabaababaa=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aababaa ⇒ abaaaba
2.	abaaabaa ⇒ aaabaaba
3.	ababaaa ⇒ aabaaba
4.	aaabaababa ⇒ a
5.	aaabababaa ⇒ abaaaababa
6.	aaabaabaabaa ⇒ abaaaaabaaba
7.	aaaababababaa ⇒ abaaaaabababa
8.	aabaabababaa ⇒ ababaabaaaba
9.	aabaabaabaababa ⇒ ababaa
10.	aabababaabaaaba ⇒ ababaabaaaababa
11.	aabaababababaa ⇒ abaabaabaababa
12.	abaaaababababaa ⇒ aabaabaaabababa
13.	aabababaabaaaababa ⇒ ababaabaa
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ba, [2/2] ab
Length 3:	[3/0] aba, [3/1] baa, [3/2] aab, [3/3] bab, [3/4] aaa
Length 4:	[4/0] abaa, [4/1] aaba, [4/2] baba, [4/3] abab, [4/4] aaab, [4/5] baab, [4/6] baaa
Length 5:	[5/0] ababa, [5/1] aabaa, [5/2] babaa, [5/3] aabab, [5/4] aaaba, [5/5] babab, [5/6] baaba
Length 6:	[6/0] aababa, [6/1] ababaa, [6/2] aabaab, [6/3] bababa, [6/4] ababab, [6/5] abaaba, [6/6] baabaa
Length 7:	[7/0] bababaa, [7/1] aabaaba, [7/2] abababa, [7/3] aababab, [7/4] abaabaa, [7/5] baababa, [7/6] aaababa

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

Reduction order:
- Right-to-left recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1
Auxiliary generators:
1. aba=c

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