Morphocompletion for #4354 ⟨a, b | abbbaaaab=bb⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abbbaaabb ⇒ bbbbaaaab
2.	abbbaaaab ⇒ bb
3.	abbbaaababbbbb ⇒ bbbbaaaaabbbbb
4.	abbbaaaaabbbbb ⇒ babbbbb
5.	abbbaaaaabbbabb ⇒ babbbabb
6.	abbbaaaaababbbbb ⇒ bababbbbb
7.	bbbbaaaabbaaaab ⇒ abbbaabb
8.	abbbaaaaabbbaabb ⇒ babbbaabb
9.	abbbaaaaababbbabb ⇒ bababbbabb
10.	abbbaaaaababbbaabb ⇒ bababbbaabb
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] bb, [2/1] aa, [2/2] ab, [2/3] ba
Length 3:	[3/0] abb, [3/1] bbb, [3/2] aaa, [3/3] aab, [3/4] bba, [3/5] baa, [3/6] bab
Length 4:	[4/0] abbb, [4/1] aaaa, [4/2] bbba, [4/3] aaab, [4/4] bbaa, [4/5] baaa, [4/6] bbbb
Length 5:	[5/0] abbba, [5/1] bbbaa, [5/2] aaaab, [5/3] bbaaa, [5/4] baaaa, [5/5] aaaaa, [5/6] aaabb
Length 6:	[6/0] abbbaa, [6/1] bbbaaa, [6/2] bbaaaa, [6/3] aaaaab, [6/4] baaaaa, [6/5] abbbbb, [6/6] baaaab
Length 7:	[7/0] abbbaaa, [7/1] bbbaaaa, [7/2] baaaaab, [7/3] bbaaaaa, [7/4] bbaaaab, [7/5] aaababb, [7/6] aababbb

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

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

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