Morphocompletion for #4195 ⟨a, b | aabbbaaba=ab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabbbaaba ⇒ ab
2.	ababbbaaba ⇒ abb
3.	aabbbaabb ⇒ abbbbaaba
4.	abbabbbaaba ⇒ abbb
5.	ababbbaabb ⇒ abbbbbaaba
6.	abbbbaababaaba ⇒ aabbbab
7.	abbbabbbaaba ⇒ abbbb
8.	abbabbbaabb ⇒ abbbbbbaaba
9.	abbbbbaababaaba ⇒ ababbbab
10.	abbbbabbbaaba ⇒ abbbbb
11.	abbbabbbaabb ⇒ abbbbbbbaaba
12.	abbbbbbaababaaba ⇒ abbabbbab
13.	abbbbbabbbaaba ⇒ abbbbbb
14.	abbbbabbbaabb ⇒ abbbbbbbbaaba
15.	abbbbbbabbbaaba ⇒ abbbbbbb
16.	abbbbbbbabbbaaba ⇒ abbbbbbbb
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] bb, [2/1] ab, [2/2] ba, [2/3] aa
Length 3:	[3/0] abb, [3/1] bbb, [3/2] aba, [3/3] bba, [3/4] aab, [3/5] baa, [3/6] bab
Length 4:	[4/0] abbb, [4/1] aaba, [4/2] bbba, [4/3] baab, [4/4] bbbb, [4/5] bbaa, [4/6] aabb
Length 5:	[5/0] baaba, [5/1] abbba, [5/2] abbbb, [5/3] bbaab, [5/4] bbbaa, [5/5] babbb, [5/6] baabb
Length 6:	[6/0] bbaaba, [6/1] bbbaab, [6/2] abbbaa, [6/3] babbba, [6/4] abbbbb, [6/5] bbaabb, [6/6] bbabbb
Length 7:	[7/0] bbbaaba, [7/1] abbbaab, [7/2] babbbaa, [7/3] bbbaabb, [7/4] bbabbba, [7/5] bbbabbb, [7/6] abbbbbb

Considering [length 4 / frequency 0] abbb=c.

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

Rewriting system is complete. See ⟨a, b | aabbbaaba=ab⟩.