Morphocompletion for #4306 ⟨a, b | ababbaaab=aa⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaabbaaab ⇒ ababbaaaa
2.	ababbaaab ⇒ aa
3.	aaaaabaabbaaab ⇒ aaaaabbabbaaaa
4.	aaabbababbaaaa ⇒ ababbaaaabaaab
5.	aaaaabbabbaaab ⇒ aaaaaba
6.	ababbababbaaaa ⇒ aabaaab
7.	aabaaabbabbaaab ⇒ aabaaaba
8.	aaaaababbabbaaab ⇒ aaaaababa
9.	aaaaabaabbabbaaab ⇒ aaaaabaaba
10.	aabaaababbabbaaab ⇒ aabaaababa
11.	aabaaabaabbabbaaab ⇒ aabaaabaaba
	...

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] aaa, [3/1] aab, [3/2] abb, [3/3] bba, [3/4] baa, [3/5] bab, [3/6] aba
Length 4:	[4/0] aaab, [4/1] abba, [4/2] aaaa, [4/3] baaa, [4/4] babb, [4/5] bbaa, [4/6] aaba
Length 5:	[5/0] baaab, [5/1] babba, [5/2] abbaa, [5/3] bbaaa, [5/4] aabaa, [5/5] ababb, [5/6] abbab
Length 6:	[6/0] bbaaab, [6/1] abbaaa, [6/2] babbaa, [6/3] ababba, [6/4] aaaaab, [6/5] abbabb, [6/6] bbabba
Length 7:	[7/0] abbaaab, [7/1] babbaaa, [7/2] abbabba, [7/3] bbabbaa, [7/4] aabaaab, [7/5] aaaaaba, [7/6] aabbabb

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

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

Rewriting system is complete. See ⟨a, b | ababbaaab=aa⟩.