Morphocompletion for #5235 ⟨a, b | aabbaba=bbaa⟩

Solved by morph:2/2. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabbaba ⇒ bbaa
2.	aabbabbbaa ⇒ bbabbaa
3.	aabbabbbbbaa ⇒ bbabbbbaa
4.	aabbabbbabbaa ⇒ bbabbabbaa
5.	aabbabbbbbbbaa ⇒ bbabbbbbbaa
6.	aabbabbbabbbbaa ⇒ bbabbabbbbaa
7.	aabbabbbbbabbaa ⇒ bbabbbbabbaa
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] bb, [2/1] aa, [2/2] ba, [2/3] ab
Length 3:	[3/0] bbb, [3/1] bba, [3/2] abb, [3/3] aab, [3/4] baa, [3/5] bab, [3/6] aba
Length 4:	[4/0] aabb, [4/1] bbaa, [4/2] bbab, [4/3] bbbb, [4/4] babb, [4/5] abba, [4/6] bbba
Length 5:	[5/0] aabba, [5/1] bbabb, [5/2] bbbaa, [5/3] babbb, [5/4] abbab, [5/5] bbbbb, [5/6] bbbba
Length 6:	[6/0] aabbab, [6/1] bbabbb, [6/2] bbbbaa, [6/3] abbabb, [6/4] babbbb, [6/5] babbaa, [6/6] bbbbba
Length 7:	[7/0] aabbabb, [7/1] abbabbb, [7/2] bbabbbb, [7/3] bbbbbaa, [7/4] bbabbaa, [7/5] babbbbb, [7/6] bbabbba

Considering [length 2 / frequency 2] ba=c.

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

Rewriting system is complete. See ⟨a, b | aabbaba=bbaa⟩.