Morphocompletion for #4211 ⟨a, b | aabbbbaba=ab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabbbbaba ⇒ ab
2.	ababbbbaba ⇒ abb
3.	aabbbbabb ⇒ abbbbbaba
4.	abbabbbbaba ⇒ abbb
5.	ababbbbabb ⇒ abbbbbbaba
6.	abbbabbbbaba ⇒ abbbb
7.	abbabbbbabb ⇒ abbbbbbbaba
8.	abbbbbababbaba ⇒ aabbbbb
9.	abbbbabbbbaba ⇒ abbbbb
10.	abbbabbbbabb ⇒ abbbbbbbbaba
11.	abbbbbbababbaba ⇒ ababbbbb
12.	abbbbbabbbbaba ⇒ abbbbbb
13.	abbbbabbbbabb ⇒ abbbbbbbbbaba
14.	abbbbbbbababbaba ⇒ abbabbbbb
15.	abbbbbbabbbbaba ⇒ abbbbbbb
16.	abbbbbbbabbbbaba ⇒ 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] bbb, [3/1] abb, [3/2] bab, [3/3] aba, [3/4] bba, [3/5] aab
Length 4:	[4/0] bbbb, [4/1] abbb, [4/2] bbab, [4/3] baba, [4/4] babb, [4/5] bbba, [4/6] abab
Length 5:	[5/0] abbbb, [5/1] bbaba, [5/2] bbbab, [5/3] bbbba, [5/4] bbabb, [5/5] bbbbb, [5/6] babbb
Length 6:	[6/0] bbbbab, [6/1] bbbaba, [6/2] bbbabb, [6/3] abbbba, [6/4] abbbbb, [6/5] babbbb, [6/6] bbabbb
Length 7:	[7/0] bbbbaba, [7/1] abbbbab, [7/2] bbbbabb, [7/3] babbbba, [7/4] bbabbbb, [7/5] abbbbbb, [7/6] bbbabbb

Considering [length 5 / frequency 0] abbbb=c.

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

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