Morphocompletion for #4768 ⟨a, b | abaaabab=aab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: roundsLimit

#	Rule
1.	aaaabab ⇒ abaaaab
2.	aaaabaab ⇒ abaaaaab
3.	aaaabaaab ⇒ abaaaaaab
4.	aaaabaaaab ⇒ abaaaaaaab
5.	aaaabaaaaab ⇒ abaaaaaaaab
6.	aaaabaaaaaab ⇒ abaaaaaaaaab
7.	aaaabaaaaaaab ⇒ abaaaaaaaaaab
8.	aaaabaaaaaaaab ⇒ abaaaaaaaaaaab
9.	aaaabaaaaaaaaab ⇒ abaaaaaaaaaaaab
10.	abaaabab ⇒ aab
11.	abaaabaab ⇒ aaab
12.	abaaabaaab ⇒ aaaab
13.	abaaabaaaab ⇒ aaaaab
14.	abaaabaaaaab ⇒ aaaaaab
15.	abaaabaaaaaab ⇒ aaaaaaab
16.	abaaabaaaaaaab ⇒ aaaaaaaab
17.	abaaabaaaaaaaab ⇒ aaaaaaaaab
18.	abaaabaaaaaaaaab ⇒ aaaaaaaaaab
19.	abaaabaaaaaaaaaab ⇒ aaaaaaaaaaab
20.	abaaabaaaaaaaaaaab ⇒ aaaaaaaaaaaab
	...

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] aab, [3/2] aba, [3/3] baa, [3/4] bab
Length 4:	[4/0] aaaa, [4/1] aaab, [4/2] abaa, [4/3] baaa, [4/4] aaba, [4/5] abab, [4/6] baab
Length 5:	[5/0] aaaab, [5/1] aaaaa, [5/2] abaaa, [5/3] aaaba, [5/4] aabaa, [5/5] baaab, [5/6] baaaa
Length 6:	[6/0] aaaaaa, [6/1] abaaab, [6/2] aaaaab, [6/3] aaaaba, [6/4] aaabaa, [6/5] aabaaa, [6/6] abaaaa
Length 7:	[7/0] abaaaba, [7/1] aaaaaaa, [7/2] aaaaaab, [7/3] aaaabaa, [7/4] aaabaaa, [7/5] aabaaaa, [7/6] abaaaaa

Considering [length 7 / frequency 0] abaaaba=c.

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

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