Morphocompletion for #4328 ⟨a, b | abbaaaaab=bb⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abbaaaabb ⇒ bbbaaaaab
2.	abbaaaaab ⇒ bb
3.	abbaaaababbbb ⇒ bbbaaaaaabbbb
4.	abbaaaababbabb ⇒ bbbaaaaaabbabb
5.	abbaaaaaabbbb ⇒ babbbb
6.	abbaaaaaabbabb ⇒ babbabb
7.	abbaaaaaabbbabbbb ⇒ babbbabbbb
8.	abbaaaaaabbaabb ⇒ babbaabb
9.	abbaaaaaabbbabbabb ⇒ babbbabbabb
10.	bbbaaaaabaaaaab ⇒ abbaaabb
11.	abbaaaaaabbaaabb ⇒ babbaaabb
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] bb, [2/2] ab, [2/3] ba
Length 3:	[3/0] abb, [3/1] aaa, [3/2] bba, [3/3] aab, [3/4] baa, [3/5] bbb, [3/6] bab
Length 4:	[4/0] aaaa, [4/1] abba, [4/2] aaab, [4/3] baaa, [4/4] bbaa, [4/5] aabb, [4/6] babb
Length 5:	[5/0] abbaa, [5/1] aaaaa, [5/2] aaaab, [5/3] baaaa, [5/4] bbaaa, [5/5] aaabb, [5/6] bbabb
Length 6:	[6/0] abbaaa, [6/1] aaaaab, [6/2] bbaaaa, [6/3] baaaaa, [6/4] aaaabb, [6/5] aaaaaa, [6/6] abbabb
Length 7:	[7/0] abbaaaa, [7/1] bbaaaaa, [7/2] aaaaaab, [7/3] baaaaaa, [7/4] aaaaabb, [7/5] baaaaab, [7/6] babbabb

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

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

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