Morphocompletion for #969 ⟨a, b | abaaaab=ba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abaaaab ⇒ ba
2.	baaaaab ⇒ abaaaba
3.	baaaaaab ⇒ aabaabaa
4.	baaaaaaab ⇒ aaababaaa
5.	baaaaaaaab ⇒ aaaabbaaaa
6.	baaaaaaaaabb ⇒ aaaaabbaaaba
7.	bbaaaaaaaaab ⇒ abaaabbaaaaa
8.	baaaaaaaaaabb ⇒ aaaaaabbaabaa
9.	baaaaaaaaabab ⇒ aaaaababaabaa
10.	aaaaabbaaaabaaaa ⇒ baaaaaaaaab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ab, [2/2] ba, [2/3] bb
Length 3:	[3/0] aaa, [3/1] baa, [3/2] aab, [3/3] abb, [3/4] aba, [3/5] bba, [3/6] bab
Length 4:	[4/0] aaaa, [4/1] baaa, [4/2] aaab, [4/3] aabb, [4/4] abaa, [4/5] bbaa, [4/6] aaba
Length 5:	[5/0] aaaaa, [5/1] baaaa, [5/2] aaaab, [5/3] aaabb, [5/4] abaaa, [5/5] bbaaa, [5/6] aaaba
Length 6:	[6/0] aaaaaa, [6/1] baaaaa, [6/2] aaaaab, [6/3] aaaabb, [6/4] abaaaa, [6/5] bbaaaa, [6/6] baaaab
Length 7:	[7/0] aaaaaaa, [7/1] baaaaaa, [7/2] aaaaaab, [7/3] aaaaabb, [7/4] aabaaaa, [7/5] bbaaaaa, [7/6] aaaabab

Considering [length 5 / frequency 1] baaaa=c.

Auxiliary generators:
1. c = baaaa
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 | abaaaab=ba⟩.