Morphocompletion for #5231 ⟨a, b | aabbaba=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.	aabbaba ⇒ baaa
2.	aabbabbaaa ⇒ baabaaa
3.	aabbabbabaaa ⇒ baababaaa
4.	aabbabbaabaaa ⇒ baabaabaaa
5.	aabbabbababaaa ⇒ baabababaaa
6.	aabbabbaababaaa ⇒ baabaababaaa
7.	aabbabbabaabaaa ⇒ 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] bba, [3/2] abb, [3/3] aaa, [3/4] bab, [3/5] aba, [3/6] baa
Length 4:	[4/0] aabb, [4/1] abba, [4/2] baaa, [4/3] bbab, [4/4] baba, [4/5] abaa, [4/6] babb
Length 5:	[5/0] aabba, [5/1] abaaa, [5/2] abbab, [5/3] babba, [5/4] bbabb, [5/5] bbaba, [5/6] babaa
Length 6:	[6/0] aabbab, [6/1] babaaa, [6/2] bbabba, [6/3] abbabb, [6/4] abbaba, [6/5] aabaaa, [6/6] babbaa
Length 7:	[7/0] aabbabb, [7/1] abbabba, [7/2] baabaaa, [7/3] ababaaa, [7/4] bbabbaa, [7/5] babbaba, [7/6] bbabbab

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 | aabbaba=baaa⟩.