Morphocompletion for #2074 ⟨a, b | abbaaaab=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.	abbaaabb ⇒ bbbaaaab
2.	abbaaaab ⇒ bb
3.	abbaaababbbb ⇒ bbbaaaaabbbb
4.	abbaaababbabb ⇒ bbbaaaaabbabb
5.	abbaaaaabbbb ⇒ babbbb
6.	bbbaaaabaaabb ⇒ abbaabbbaaaab
7.	abbaaaaabbabb ⇒ babbabb
8.	abbaaaaabbbabbbb ⇒ babbbabbbb
9.	bbbaaaabaaaab ⇒ abbaabb
10.	abbaaaaabbaabb ⇒ babbaabb
11.	abbaaaaababbabb ⇒ bababbabb
12.	abbaaaaababbaabb ⇒ bababbaabb
	...

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] aaa, [3/2] aab, [3/3] bba, [3/4] baa, [3/5] bbb, [3/6] bab
Length 4:	[4/0] abba, [4/1] aaaa, [4/2] aaab, [4/3] baaa, [4/4] bbaa, [4/5] aabb, [4/6] babb
Length 5:	[5/0] abbaa, [5/1] aaaab, [5/2] bbaaa, [5/3] baaaa, [5/4] aaabb, [5/5] bbabb, [5/6] aaaaa
Length 6:	[6/0] abbaaa, [6/1] bbaaaa, [6/2] aaaaab, [6/3] baaaaa, [6/4] baaaab, [6/5] abbabb, [6/6] aaaaba
Length 7:	[7/0] abbaaaa, [7/1] baaaaab, [7/2] bbaaaaa, [7/3] abbaaab, [7/4] aaaaabb, [7/5] aaababb, [7/6] bbaaaab

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

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

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