Morphocompletion for #4591 ⟨a, b | aabaaaab=aba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabaaaab ⇒ aba
2.	abaaaaab ⇒ aabaaaba
3.	abaaaaaab ⇒ aaabaabaa
4.	abaaaaaaab ⇒ aaaababaaa
5.	abaaaaaaaabab ⇒ aaaaababaaaba
6.	ababaaaaaaaab ⇒ aabaaababaaaa
7.	abaaaaaaaaabab ⇒ aaaaaababaabaa
8.	abaaaaaaaabaab ⇒ aaaaabaabaabaa
9.	aaaaababaaaabaaa ⇒ abaaaaaaaab
	...

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] aab, [3/3] baa, [3/4] bab
Length 4:	[4/0] aaaa, [4/1] abaa, [4/2] aaab, [4/3] baaa, [4/4] aaba, [4/5] abab, [4/6] baba
Length 5:	[5/0] aaaaa, [5/1] abaaa, [5/2] aaaab, [5/3] baaaa, [5/4] aaaba, [5/5] aabab, [5/6] aabaa
Length 6:	[6/0] aaaaaa, [6/1] abaaaa, [6/2] aaaaab, [6/3] baaaaa, [6/4] aaaaba, [6/5] aaabab, [6/6] aabaaa
Length 7:	[7/0] abaaaaa, [7/1] aaaaaaa, [7/2] aaaaaab, [7/3] baaaaaa, [7/4] aaaaaba, [7/5] aaaabab, [7/6] ababaaa

Considering [length 5 / frequency 2] aaaab=c.

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

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