Morphocompletion for #2675 ⟨a, b | abaab=aabba⟩

Solved by morph:5/3,3/1. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abaab ⇒ aabba
2.	abaaabba ⇒ aabbaaab
3.	aabbaaabbaab ⇒ aabbaaababba
4.	aabbabaaababba ⇒ aabbaabbaaabab
5.	aabbaaabbaaabba ⇒ aabbaaababbaaab
6.	aabbababaaababba ⇒ aabbaabbabaaabab
7.	aabbaaabbaaababba ⇒ aabbaaababbaaabab
8.	aabbaabbaaababbaab ⇒ aabbaabbaaabababba
9.	aabbabababaaababba ⇒ aabbaabbababaaabab
	...

Collecting factors up to length 7, frequency 4:

Considering [length 5 / frequency 3] babba=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] ba, [2/1] ab, [2/2] aa, [2/3] bb, [2/4] ac, [2/5] ca, [2/6] cb
Length 3:	[3/0] bba, [3/1] baa, [3/2] aab, [3/3] abb, [3/4] aba, [3/5] aac, [3/6] cab
Length 4:	[4/0] abba, [4/1] baac, [4/2] abaa, [4/3] aabb, [4/4] cabb, [4/5] baab, [4/6] cbaa
Length 5:	[5/0] abaac, [5/1] aabba, [5/2] cabba, [5/3] abbaa, [5/4] bbaab, [5/5] baaab, [5/6] aaabb

Considering [length 3 / frequency 1] baa=d.

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

Rewriting system is complete. See ⟨a, b | abaab=aabba⟩.