Morphocompletion for #4081 ⟨a, b | aabaaabba=ab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabaaabba ⇒ ab
2.	abbaaabba ⇒ aabaaabbb
3.	ababaaabba ⇒ abb
4.	aabaaaabaaabbb ⇒ abaabba
5.	abbbaaabba ⇒ ababaaabbb
6.	abbabaaabba ⇒ abbb
7.	ababaaaabaaabbb ⇒ abbaabba
8.	abbbbaaabba ⇒ abbabaaabbb
9.	abbbabaaabba ⇒ abbbb
10.	abbabaaaabaaabbb ⇒ abbbaabba
11.	abbbbbaaabba ⇒ abbbabaaabbb
12.	abbbbabaaabba ⇒ abbbbb
13.	abbbbbabaaabba ⇒ abbbbbb
14.	abbbbbbabaaabba ⇒ abbbbbbb
15.	abbbbbbbabaaabba ⇒ 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] bba, [3/2] bbb, [3/3] aab, [3/4] aaa, [3/5] baa, [3/6] aba
Length 4:	[4/0] abba, [4/1] abbb, [4/2] baaa, [4/3] aaab, [4/4] aabb, [4/5] abaa, [4/6] bbbb
Length 5:	[5/0] aabba, [5/1] baaab, [5/2] aaabb, [5/3] abaaa, [5/4] abbbb, [5/5] babaa, [5/6] bbbbb
Length 6:	[6/0] aaabba, [6/1] baaabb, [6/2] abaaab, [6/3] babaaa, [6/4] abbbbb, [6/5] bbabaa, [6/6] aabaaa
Length 7:	[7/0] baaabba, [7/1] abaaabb, [7/2] bbabaaa, [7/3] babaaab, [7/4] baaabbb, [7/5] bbbabaa, [7/6] aabaaab

Considering [length 3 / frequency 0] abb=c.

Reduction order:
- Right-to-left recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1
Auxiliary generators:
1. abb=c

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