Morphocompletion for #5659 ⟨a, b | aabaab=abbba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	aabaab ⇒ abbba
2.	aababbba ⇒ abbbaaab
3.	abbbaaababaab ⇒ abbbaaabbbba
4.	abbbaaabababbba ⇒ abbbaaabbbbaaab
5.	abbbabbaaababaab ⇒ abbbabbaaabbbba
6.	abbbabbaaabababbba ⇒ abbbabbaaabbbbaaab
7.	abbbabbabbaaababaab ⇒ abbbabbabbaaabbbba
8.	abbbaaabbbbaaababaab ⇒ abbbaaabbbbaaabbbba
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ab, [2/1] ba, [2/2] bb, [2/3] aa
Length 3:	[3/0] aab, [3/1] abb, [3/2] bba, [3/3] aba, [3/4] bab, [3/5] baa, [3/6] bbb
Length 4:	[4/0] abbb, [4/1] bbba, [4/2] aaba, [4/3] baab, [4/4] abab, [4/5] aaab, [4/6] baaa
Length 5:	[5/0] abbba, [5/1] abaab, [5/2] aabab, [5/3] baaab, [5/4] bbaaa, [5/5] aaaba, [5/6] ababa
Length 6:	[6/0] babaab, [6/1] bbaaab, [6/2] aaabab, [6/3] aababa, [6/4] abbbaa, [6/5] abbbab, [6/6] baaaba
Length 7:	[7/0] ababaab, [7/1] aaababa, [7/2] ababbba, [7/3] abbbaaa, [7/4] abbbabb, [7/5] baaabab, [7/6] bbaaaba

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

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

Rewriting system is complete. See ⟨a, b | aabaab=abbba⟩.