Morphocompletion for #5199 ⟨a, b | aababba=baaa⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aababba ⇒ baaa
2.	aababbbaaa ⇒ baabaaa
3.	aababbbabaaa ⇒ baababaaa
4.	aababbbaabaaa ⇒ baabaabaaa
5.	aababbbababaaa ⇒ baabababaaa
6.	aababbbaababaaa ⇒ baabaababaaa
7.	aababbbabaabaaa ⇒ baababaabaaa
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ba, [2/2] ab, [2/3] bb
Length 3:	[3/0] aab, [3/1] aba, [3/2] aaa, [3/3] bab, [3/4] baa, [3/5] bba, [3/6] abb
Length 4:	[4/0] aaba, [4/1] baaa, [4/2] abab, [4/3] babb, [4/4] abaa, [4/5] bbba, [4/6] abbb
Length 5:	[5/0] aabab, [5/1] abaaa, [5/2] ababb, [5/3] abbba, [5/4] babbb, [5/5] babaa, [5/6] baaba
Length 6:	[6/0] aababb, [6/1] babaaa, [6/2] babbba, [6/3] ababbb, [6/4] aabaaa, [6/5] abbbaa, [6/6] bbbaba
Length 7:	[7/0] aababbb, [7/1] ababbba, [7/2] baabaaa, [7/3] ababaaa, [7/4] babbbaa, [7/5] abbbaba, [7/6] babbbab

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

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

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