Morphocompletion for #3461 ⟨a, b | aaabababaa=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.	aabababa ⇒ abababaa
3.	abababaaaa ⇒ a
4.	abababaabaaaa ⇒ aaba
5.	abababaaabaaaa ⇒ aaaba
6.	abababaababaaaa ⇒ aababa
7.	abababaabaabaaaa ⇒ aabaaba
8.	abababaaababaaaa ⇒ aaababa
9.	abababaabaaabaaaa ⇒ aabaaaba
10.	abababaaabaabaaaa ⇒ aaabaaba
11.	abababaababaabaaaa ⇒ aababaaba
12.	abababaabaababaaaa ⇒ aabaababa
13.	abababaaabaaabaaaa ⇒ aaabaaaba
14.	abababaababaaabaaaa ⇒ aababaaaba
15.	abababaabaabaabaaaa ⇒ aabaabaaba
16.	abababaabaaababaaaa ⇒ aabaaababa
	...

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] bab, [3/4] aab
Length 4:	[4/0] abab, [4/1] abaa, [4/2] baba, [4/3] aaaa, [4/4] aaba, [4/5] baaa, [4/6] baab
Length 5:	[5/0] ababa, [5/1] baaaa, [5/2] abaaa, [5/3] babaa, [5/4] aabaa, [5/5] abaab, [5/6] baaba
Length 6:	[6/0] ababab, [6/1] abaaaa, [6/2] ababaa, [6/3] bababa, [6/4] abaaba, [6/5] aabaaa, [6/6] baabaa
Length 7:	[7/0] abababa, [7/1] aabaaaa, [7/2] bababaa, [7/3] abaabaa, [7/4] ababaaa, [7/5] ababaab, [7/6] babaaaa

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

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

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