Morphocompletion for #5400 ⟨a, b | abbabba=aabb⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abbabba ⇒ aabb
2.	abbaabb ⇒ aabbbba
3.	aabbbbabba ⇒ aabbabb
4.	aabbbbaabb ⇒ aabbabbbba
5.	abbaaabbbb ⇒ aaabbbbbba
6.	aabbabbbbaa ⇒ abbaaabb
7.	aabbabbbbabba ⇒ aaabbbb
8.	aaabbbbbbabba ⇒ aaabbbbabb
9.	aabbbbaaabb ⇒ aaabbbbbbaa
10.	aaabbbbbbaabb ⇒ aaabbbbabbbba
11.	abbaaabbabbbb ⇒ aaabbabbbbbba
12.	abbaaaabbbbbb ⇒ aaaabbbbbbbba
13.	aaabbbbabbbbaa ⇒ abbaaabbabb
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] bb, [2/1] aa, [2/2] ab, [2/3] ba
Length 3:	[3/0] abb, [3/1] bbb, [3/2] bba, [3/3] aab, [3/4] aaa, [3/5] baa, [3/6] bab
Length 4:	[4/0] aabb, [4/1] abba, [4/2] bbbb, [4/3] abbb, [4/4] bbaa, [4/5] aaab, [4/6] bbba
Length 5:	[5/0] abbbb, [5/1] aaabb, [5/2] aabbb, [5/3] bbbba, [5/4] abbaa, [5/5] babba, [5/6] bbabb
Length 6:	[6/0] aabbbb, [6/1] aaabbb, [6/2] bbabba, [6/3] abbbba, [6/4] bbbbaa, [6/5] abbaaa, [6/6] bbaabb
Length 7:	[7/0] aaabbbb, [7/1] aabbbba, [7/2] abbbbaa, [7/3] bbbabba, [7/4] aabbabb, [7/5] bbabbbb, [7/6] abbaaab

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

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

Rewriting system is complete. See ⟨a, b | abbabba=aabb⟩.