Morphocompletion for #3857 ⟨a, b | aaaaaabba=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.	aaaaaabba ⇒ ab
2.	abaaaabba ⇒ aaaaaabbb
3.	abaaaaabba ⇒ abb
4.	aaaaaabaaaaabbb ⇒ abaaabba
5.	abbaaaabba ⇒ abaaaaabbb
6.	abbaaaaabba ⇒ abbb
7.	abaaaaabaaaaabbb ⇒ abbaaabba
8.	abbbaaaabba ⇒ abbaaaaabbb
9.	abbbaaaaabba ⇒ abbbb
10.	abbaaaaabaaaaabbb ⇒ abbbaaabba
11.	abbbbaaaabba ⇒ abbbaaaaabbb
12.	abbbbaaaaabba ⇒ abbbbb
13.	abbbbbaaaabba ⇒ abbbbaaaaabbb
14.	abbbbbaaaaabba ⇒ abbbbbb
15.	abbbbbbaaaaabba ⇒ abbbbbbb
16.	abbbbbbbaaaaabba ⇒ abbbbbbbb
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] bb, [2/2] ab, [2/3] ba
Length 3:	[3/0] aaa, [3/1] abb, [3/2] bba, [3/3] bbb, [3/4] aab, [3/5] baa, [3/6] aba
Length 4:	[4/0] aaaa, [4/1] abba, [4/2] abbb, [4/3] aaab, [4/4] baaa, [4/5] aabb, [4/6] bbbb
Length 5:	[5/0] aabba, [5/1] aaaab, [5/2] aaaaa, [5/3] baaaa, [5/4] aaabb, [5/5] abbbb, [5/6] bbaaa
Length 6:	[6/0] aaabba, [6/1] aaaabb, [6/2] aaaaab, [6/3] baaaaa, [6/4] bbaaaa, [6/5] abaaaa, [6/6] abbbbb
Length 7:	[7/0] aaaabba, [7/1] baaaaab, [7/2] aaaaabb, [7/3] bbbaaaa, [7/4] bbaaaaa, [7/5] abaaaaa, [7/6] bbbbaaa

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

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

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