Morphocompletion for #1241 ⟨a, b | abaab=aaba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abaab ⇒ aaba
2.	abaaaba ⇒ aabaaab
3.	abaaaaba ⇒ aaabaaabb
4.	aabaaabbaab ⇒ aaabaaabba
5.	abaaaaaba ⇒ aaabaaabbab
6.	aaabaaabbbaab ⇒ aaabaaabbaba
7.	aabaaaabbaab ⇒ aaaabaaabbba
8.	abaaaaaaba ⇒ aaabaaabbabab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ab, [2/2] ba, [2/3] bb
Length 3:	[3/0] aba, [3/1] aab, [3/2] aaa, [3/3] baa, [3/4] bba, [3/5] abb, [3/6] bbb
Length 4:	[4/0] abaa, [4/1] aaba, [4/2] aaab, [4/3] baab, [4/4] aaaa, [4/5] baaa, [4/6] bbaa
Length 5:	[5/0] abaaa, [5/1] aaaba, [5/2] bbaab, [5/3] aabaa, [5/4] baaaa, [5/5] aaaab, [5/6] aaaaa
Length 6:	[6/0] abaaaa, [6/1] aaaaba, [6/2] aabaaa, [6/3] abaaab, [6/4] abbaab, [6/5] baaaaa, [6/6] aaabaa
Length 7:	[7/0] abaaaaa, [7/1] aaaaaba, [7/2] aabbaab, [7/3] abaaaab, [7/4] aabaaab, [7/5] aabaaaa, [7/6] aaabaaa

Considering [length 4 / frequency 0] abaa=c.

Auxiliary generators:
1. c = abaa
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 | abaab=aaba⟩.