Morphocompletion for #1105 ⟨a, b | abaaab=aba⟩

Solved by morph:4/1. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: roundsLimit

#	Rule
1.	abaaab ⇒ aba
2.	abaaaab ⇒ abaa
3.	abaaaaab ⇒ abaaa
4.	abaaaaaab ⇒ abaaaa
5.	abaaaaaaab ⇒ abaaaaa
6.	abaaaaaaaab ⇒ abaaaaaa
7.	abaaaaaaaaab ⇒ abaaaaaaa
8.	abaaaaaaaaaab ⇒ abaaaaaaaa
9.	abaaaaaaaaaaab ⇒ abaaaaaaaaa
10.	abaaaaaaaaaaaab ⇒ abaaaaaaaaaa
11.	abaaaaaaaaaaaaab ⇒ abaaaaaaaaaaa
12.	abaaaaaaaaaaaaaab ⇒ abaaaaaaaaaaaa
13.	abaaaaaaaaaaaaaaab ⇒ abaaaaaaaaaaaaa
14.	abaaaaaaaaaaaaaaaab ⇒ abaaaaaaaaaaaaaa
15.	abaaaaaaaaaaaaaaaaab ⇒ abaaaaaaaaaaaaaaa
16.	abaaaaaaaaaaaaaaaaaab ⇒ abaaaaaaaaaaaaaaaa
17.	abaaaaaaaaaaaaaaaaaaab ⇒ abaaaaaaaaaaaaaaaaa
18.	abaaaaaaaaaaaaaaaaaaaab ⇒ abaaaaaaaaaaaaaaaaaa
19.	abaaaaaaaaaaaaaaaaaaaaab ⇒ abaaaaaaaaaaaaaaaaaaa
20.	abaaaaaaaaaaaaaaaaaaaaaab ⇒ abaaaaaaaaaaaaaaaaaaaa
	...

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
Length 4:	[4/0] aaaa, [4/1] abaa, [4/2] aaab, [4/3] baaa
Length 5:	[5/0] aaaaa, [5/1] abaaa, [5/2] aaaab, [5/3] baaaa, [5/4] baaab
Length 6:	[6/0] aaaaaa, [6/1] abaaaa, [6/2] aaaaab, [6/3] baaaaa, [6/4] baaaab
Length 7:	[7/0] aaaaaaa, [7/1] abaaaaa, [7/2] aaaaaab, [7/3] baaaaaa, [7/4] baaaaab

Considering [length 4 / frequency 1] abaa=c.

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

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