Morphocompletion for #3535 ⟨a, b | aabaaaaaba=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: roundsLimit

#	Rule
1.	abaaaa ⇒ aaaaba
2.	aaaaabaaba ⇒ a
3.	abaabaa ⇒ aabaaba
4.	aaaaaaababaaba ⇒ abaaa
5.	aaaabaaabaaba ⇒ abaa
6.	aabaababaa ⇒ abaaabaaba
7.	abaababaaa ⇒ aaababaaba
8.	aaaaaaabababaaba ⇒ ababaaa
9.	aaaaaaabaaababaaba ⇒ abaaabaaa
10.	aaaababaaabaaba ⇒ ababaa
11.	aaaabaaabaaabaaba ⇒ abaaabaa
12.	aabaabababaa ⇒ ababaaabaaba
13.	aaaabababaaabaaba ⇒ abababaa
	...

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] aaa, [3/2] aab, [3/3] baa, [3/4] bab
Length 4:	[4/0] aaba, [4/1] abaa, [4/2] aaaa, [4/3] aaab, [4/4] baab, [4/5] baba, [4/6] abab
Length 5:	[5/0] baaba, [5/1] aabaa, [5/2] abaab, [5/3] aaaba, [5/4] aaaaa, [5/5] aaaab, [5/6] ababa
Length 6:	[6/0] abaaba, [6/1] aaaaba, [6/2] ababaa, [6/3] aabaab, [6/4] aaabaa, [6/5] aaaaaa, [6/6] aababa
Length 7:	[7/0] aabaaba, [7/1] babaaba, [7/2] aababaa, [7/3] abaaaba, [7/4] aaaabab, [7/5] aaaabaa, [7/6] aaaaaaa

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

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

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