Morphocompletion for #4187 ⟨a, b | aabbabbba=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.	aabbabbba ⇒ ab
2.	abbbabbba ⇒ aabbabbbb
3.	ababbabbba ⇒ abb
4.	abbbbabbba ⇒ ababbabbbb
5.	abbabbabbba ⇒ abbb
6.	abbbbbabbba ⇒ abbabbabbbb
7.	abbbabbabbba ⇒ abbbb
8.	abbbbbbabbba ⇒ abbbabbabbbb
9.	aabbaabbabbbb ⇒ abbbba
10.	abbbbabbabbba ⇒ abbbbb
11.	ababbaabbabbbb ⇒ abbbbba
12.	abbbbbabbabbba ⇒ abbbbbb
13.	abbabbaabbabbbb ⇒ abbbbbba
14.	abbbbbbabbabbba ⇒ abbbbbbb
15.	abbbabbaabbabbbb ⇒ abbbbbbba
16.	abbbbbbbabbabbba ⇒ 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] bba, [3/2] bbb, [3/3] bab, [3/4] aab, [3/5] baa, [3/6] aba
Length 4:	[4/0] abbb, [4/1] bbba, [4/2] babb, [4/3] bbbb, [4/4] bbab, [4/5] abba, [4/6] aabb
Length 5:	[5/0] abbba, [5/1] bbabb, [5/2] abbbb, [5/3] babbb, [5/4] abbab, [5/5] bbbab, [5/6] babba
Length 6:	[6/0] babbba, [6/1] bbabbb, [6/2] abbabb, [6/3] bbbabb, [6/4] abbbbb, [6/5] bbabba, [6/6] babbbb
Length 7:	[7/0] bbabbba, [7/1] abbabbb, [7/2] bbabbbb, [7/3] bbbbabb, [7/4] babbabb, [7/5] bbbabba, [7/6] bbabbab

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 | aabbabbba=ab⟩.