Morphocompletion for #5857 ⟨a, b | abaaba=babab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abaaba ⇒ babab
2.	babababa ⇒ abababab
3.	baabababab ⇒ ababababba
4.	bababbaaba ⇒ abaabbabab
5.	bababbababba ⇒ abbababbabab
6.	aababababba ⇒ bababbabab
7.	ababababbaba ⇒ bbababbabab
8.	ababababbbaba ⇒ bbbababbabab
9.	ababababbbbaba ⇒ bbbbababbabab
10.	baaabababab ⇒ ababababbaa
11.	baaaabababab ⇒ ababababbaaa
12.	baaaaabababab ⇒ ababababbaaaa
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ba, [2/1] ab, [2/2] aa, [2/3] bb
Length 3:	[3/0] aba, [3/1] bab, [3/2] baa, [3/3] bba, [3/4] aab, [3/5] abb, [3/6] aaa
Length 4:	[4/0] abab, [4/1] baba, [4/2] aaba, [4/3] abba, [4/4] babb, [4/5] baaa, [4/6] baab
Length 5:	[5/0] babab, [5/1] ababa, [5/2] bbaba, [5/3] babba, [5/4] ababb, [5/5] baaba, [5/6] aabab
Length 6:	[6/0] ababab, [6/1] bababa, [6/2] bababb, [6/3] ababba, [6/4] aababa, [6/5] bbbaba, [6/6] aaabab
Length 7:	[7/0] bababab, [7/1] abababa, [7/2] bababba, [7/3] aababab, [7/4] abababb, [7/5] aaababa, [7/6] babbaba

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

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

Rewriting system is complete. See ⟨a, b | abaaba=babab⟩.