Morphocompletion for #5203 ⟨a, b | aababba=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.	aababba ⇒ bbaa
2.	aababbbbaa ⇒ bbabbaa
3.	aababbbbbbaa ⇒ bbabbbbaa
4.	aababbbbabbaa ⇒ bbabbabbaa
5.	aababbbbbbbbaa ⇒ bbabbbbbbaa
6.	aababbbbabbbbaa ⇒ bbabbabbbbaa
7.	aababbbbbbabbaa ⇒ 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] aab, [3/2] baa, [3/3] bba, [3/4] bab, [3/5] abb, [3/6] aba
Length 4:	[4/0] bbbb, [4/1] aaba, [4/2] bbaa, [4/3] babb, [4/4] bbba, [4/5] abbb, [4/6] abab
Length 5:	[5/0] aabab, [5/1] bbbbb, [5/2] bbbaa, [5/3] bbbba, [5/4] babbb, [5/5] abbbb, [5/6] ababb
Length 6:	[6/0] aababb, [6/1] bbbbaa, [6/2] babbbb, [6/3] ababbb, [6/4] bbbbbb, [6/5] abbbba, [6/6] babbaa
Length 7:	[7/0] aababbb, [7/1] ababbbb, [7/2] bbbbbaa, [7/3] babbbba, [7/4] bbabbaa, [7/5] abbbbaa, [7/6] bbbbbba

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

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

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