Morphocompletion for #4140 ⟨a, b | aababbbaa=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.	aababbbaa ⇒ ab
2.	abababbbaa ⇒ abb
3.	aababbbab ⇒ abbabbbaa
4.	abbababbbaa ⇒ abbb
5.	abababbbab ⇒ abbbabbbaa
6.	abbbababbbaa ⇒ abbbb
7.	abbababbbab ⇒ abbbbabbbaa
8.	abbbbababbbaa ⇒ abbbbb
9.	abbbababbbab ⇒ abbbbbabbbaa
10.	abbabbbaaabbbaa ⇒ aababbbb
11.	abbbbbababbbaa ⇒ abbbbbb
12.	abbbbababbbab ⇒ abbbbbbabbbaa
13.	abbbabbbaaabbbaa ⇒ abababbbb
14.	abbbbbbababbbaa ⇒ abbbbbbb
15.	abbbbbbbababbbaa ⇒ abbbbbbbb
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ab, [2/1] bb, [2/2] ba, [2/3] aa
Length 3:	[3/0] abb, [3/1] bbb, [3/2] bab, [3/3] bba, [3/4] baa, [3/5] aba, [3/6] aab
Length 4:	[4/0] abbb, [4/1] bbba, [4/2] bbaa, [4/3] bbab, [4/4] abab, [4/5] babb, [4/6] bbbb
Length 5:	[5/0] abbba, [5/1] bbbaa, [5/2] bbbab, [5/3] babbb, [5/4] ababb, [5/5] babab, [5/6] abbbb
Length 6:	[6/0] abbbaa, [6/1] abbbab, [6/2] babbba, [6/3] ababbb, [6/4] bababb, [6/5] bbabab, [6/6] bbbaba
Length 7:	[7/0] babbbaa, [7/1] ababbba, [7/2] bababbb, [7/3] babbbab, [7/4] bbababb, [7/5] bbbabab, [7/6] bbbbaba

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

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

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