Morphocompletion for #996 ⟨a, b | abbaaab=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.	bbbaaab ⇒ abbaabb
2.	abbaaab ⇒ bb
3.	bbbaaaabbbb ⇒ abbaababbbb
4.	abbaaaabbbb ⇒ babbbb
5.	bbbaaaabbabb ⇒ abbaababbabb
6.	abbaaaabbabb ⇒ babbabb
7.	abbaaaabbbabbbb ⇒ babbbabbbb
8.	abbaaaabbaabb ⇒ babbaabb
9.	abbaaaababbaabb ⇒ bababbaabb
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] bb, [2/1] ab, [2/2] aa, [2/3] ba
Length 3:	[3/0] abb, [3/1] aaa, [3/2] bbb, [3/3] bba, [3/4] aab, [3/5] baa, [3/6] bab
Length 4:	[4/0] abba, [4/1] aaab, [4/2] bbaa, [4/3] aabb, [4/4] baaa, [4/5] aaaa, [4/6] bbba
Length 5:	[5/0] abbaa, [5/1] bbaaa, [5/2] baaaa, [5/3] aaaab, [5/4] aaabb, [5/5] bbbaa, [5/6] abbbb
Length 6:	[6/0] abbaaa, [6/1] bbaaaa, [6/2] baaaab, [6/3] aaaabb, [6/4] bbbaaa, [6/5] bbaaab, [6/6] bbaabb
Length 7:	[7/0] abbaaaa, [7/1] bbaaaab, [7/2] baaaabb, [7/3] bbbaaaa, [7/4] abbaabb, [7/5] aabbabb, [7/6] aaabbbb

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

Auxiliary generators:
1. c = aaab
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 | abbaaab=bb⟩.