Morphocompletion for #5137 ⟨a, b | aabaaba=abaa⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abaaaba ⇒ aababaa
2.	aabaaba ⇒ abaa
3.	ababaaaaba ⇒ aabababaaa
4.	abaaaababa ⇒ aaabababaa
5.	aaababaabaa ⇒ abaaaaba
6.	ababaabaaaaba ⇒ aabababaabaaa
7.	ababaaaaababa ⇒ aaababababaaa
8.	abaaaaabababa ⇒ aaaababababaa
9.	aaababaababaaa ⇒ abaabaaaaba
10.	aaaabababaabaa ⇒ abaaaaababa
11.	aabababaaaaaba ⇒ aaababababaaaa
12.	aaababaababaabaaa ⇒ ababaaaaaba
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ba, [2/2] ab
Length 3:	[3/0] aba, [3/1] aaa, [3/2] aab, [3/3] baa, [3/4] bab
Length 4:	[4/0] aaba, [4/1] abaa, [4/2] abab, [4/3] baba, [4/4] aaab, [4/5] aaaa, [4/6] baaa
Length 5:	[5/0] ababa, [5/1] aaaba, [5/2] abaaa, [5/3] aabab, [5/4] babaa, [5/5] aaaab, [5/6] aabaa
Length 6:	[6/0] aababa, [6/1] ababaa, [6/2] aaaaba, [6/3] aaabab, [6/4] abaaaa, [6/5] abaaba, [6/6] baabaa
Length 7:	[7/0] aaababa, [7/1] ababaaa, [7/2] ababaab, [7/3] abaabaa, [7/4] babaaba, [7/5] aaaabab, [7/6] baaaaba

Considering [length 2 / frequency 0] aa=c.

Reduction order:
- Right-to-left recursive path with deg(b) = deg(c) = 0, b < c; deg(a) = 1
Auxiliary generators:
1. aa=c

Rewriting system is complete. See ⟨a, b | aabaaba=abaa⟩.