Morphocompletion for #4105 ⟨a, b | aabaabbba=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.	aabaabbba ⇒ ab
2.	abbaabbba ⇒ aabaabbbb
3.	ababaabbba ⇒ abb
4.	abbbaabbba ⇒ ababaabbbb
5.	abbabaabbba ⇒ abbb
6.	abbbbaabbba ⇒ abbabaabbbb
7.	abbbabaabbba ⇒ abbbb
8.	abbbbbaabbba ⇒ abbbabaabbbb
9.	abbbbabaabbba ⇒ abbbbb
10.	abbbbbbaabbba ⇒ abbbbabaabbbb
11.	aabaababaabbbb ⇒ ababbba
12.	abbbbbabaabbba ⇒ abbbbbb
13.	ababaababaabbbb ⇒ abbabbba
14.	abbbbbbabaabbba ⇒ abbbbbbb
15.	abbabaababaabbbb ⇒ abbbabbba
16.	abbbbbbbabaabbba ⇒ abbbbbbbb
17.	abbbabaababaabbbb ⇒ abbbbabbba
	...

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] bbb, [3/1] abb, [3/2] bba, [3/3] aab, [3/4] aba, [3/5] baa, [3/6] bab
Length 4:	[4/0] abbb, [4/1] bbba, [4/2] bbbb, [4/3] baab, [4/4] aabb, [4/5] abaa, [4/6] baba
Length 5:	[5/0] abbba, [5/1] abbbb, [5/2] baabb, [5/3] aabbb, [5/4] abaab, [5/5] babaa, [5/6] bbbbb
Length 6:	[6/0] aabbba, [6/1] baabbb, [6/2] babaab, [6/3] abaabb, [6/4] abbbbb, [6/5] bbabaa, [6/6] ababaa
Length 7:	[7/0] baabbba, [7/1] abaabbb, [7/2] babaabb, [7/3] bbabaab, [7/4] baabbbb, [7/5] ababaab, [7/6] bbbabaa

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

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

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