Morphocompletion for #4879 ⟨a, b | abbbaaab=aaa⟩

Solved by morph:3/3. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaabbaaab ⇒ abbbaaaaa
2.	abbbaaab ⇒ aaa
3.	aaaaaabaabbaaab ⇒ aaaaaabbbbaaaaa
4.	aaabbabbbaaaaa ⇒ abbbaaaaabaaab
5.	aaaaaabbbbaaab ⇒ aaaaaabaa
6.	abbbabbbaaaaa ⇒ aaabaaab
7.	aaabaaabbbbaaab ⇒ aaabaaabaa
8.	aaaaaababbbbaaab ⇒ aaaaaababaa
9.	aaabaaababbbbaaab ⇒ aaabaaababaa
10.	aaabaaabaabbbbaaab ⇒ aaabaaabaabaa
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ab, [2/2] bb, [2/3] ba
Length 3:	[3/0] aaa, [3/1] aab, [3/2] baa, [3/3] bbb, [3/4] abb, [3/5] bba, [3/6] aba
Length 4:	[4/0] aaab, [4/1] aaaa, [4/2] baaa, [4/3] abbb, [4/4] bbaa, [4/5] bbba, [4/6] aaba
Length 5:	[5/0] baaab, [5/1] aaaaa, [5/2] bbaaa, [5/3] aaaba, [5/4] bbbaa, [5/5] abbba, [5/6] aaabb
Length 6:	[6/0] bbaaab, [6/1] bbbaaa, [6/2] aaabaa, [6/3] aaaaaa, [6/4] abbbba, [6/5] bbbbaa, [6/6] abbbaa
Length 7:	[7/0] bbbaaab, [7/1] aaaaaab, [7/2] aaabaaa, [7/3] abbbbaa, [7/4] bbbbaaa, [7/5] abbaaab, [7/6] abbbaaa

Considering [length 3 / frequency 3] bbb=c.

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

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