Morphocompletion for #3728 ⟨a, b | abaabaaaab=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaaaabb ⇒ abaabaa
2.	aaabaaaab ⇒ abaabaaaa
3.	abaabaaaab ⇒ a
4.	aaaaababbaab ⇒ abaabaabaaba
5.	aaaaababaaaab ⇒ aaaaabaaabbaa
6.	abaabaabaabaaaa ⇒ aaaaab
7.	aaaaababbbaabaaaa ⇒ aaaaabab
8.	abaabaabaababaabaa ⇒ aaaaababb
	...

Collecting factors up to length 7, frequency 4:

Considering [length 3 / frequency 1] aab=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] aa, [2/1] ac, [2/2] cc, [2/3] ab, [2/4] ca, [2/5] cb, [2/6] bc
Length 3:	[3/0] aaa, [3/1] aac, [3/2] abc, [3/3] aca, [3/4] caa, [3/5] ccc, [3/6] cca
Length 4:	[4/0] aaaa, [4/1] acaa, [4/2] caac, [4/3] aaac, [4/4] abcc, [4/5] cccc, [4/6] ccaa
Length 5:	[5/0] caaaa, [5/1] acaac, [5/2] abccc, [5/3] ccaaa, [5/4] cccaa, [5/5] aacab, [5/6] abcaa

Considering [length 4 / frequency 0] aaaa=d.

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

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