Morphocompletion for #4340 ⟨a, b | abbabaaab=aa⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abbabaaab ⇒ aa
2.	abbabaaaa ⇒ aababaaab
3.	aaaaabbbabaaab ⇒ aaaaaba
4.	aaaaabbbabaaaa ⇒ aaaaabababaaab
5.	aaabaaabbbabaaab ⇒ aaabaaaba
6.	aababaaabbbabaaab ⇒ aababaaaba
7.	aaabaaababbbabaaab ⇒ aaabaaababa
8.	aababaaababbbabaaab ⇒ aababaaababa
	...

Collecting factors up to length 7 / frequency 4:

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ccaab ⇒ ca
2.	cccacaac ⇒ caa
3.	acaab ⇒ aa
4.	caaba ⇒ ccacaac
5.	accacaac ⇒ aaa
6.	caaaab ⇒ cccacaaa
7.	bbaba ⇒ c
8.	cababa ⇒ ccaac
9.	aaaba ⇒ acacaac
10.	ccacaacba ⇒ cacaac
11.	caacacaac ⇒ cccacaaaa
12.	aaaaab ⇒ accacaaa
13.	aababa ⇒ acaac
14.	acacaacba ⇒ aacaac
15.	cccacccacaaaa ⇒ caaacaac
16.	cccacccacccacaaa ⇒ caaacaacb
17.	aaacacaac ⇒ accacaaaa
18.	caaacaacba ⇒ cccacaaacaac
19.	accacccacaaaa ⇒ aaaacaac
20.	aaaacaacba ⇒ accacaaacaac
	...

Collecting factors up to length 6 / frequency 7:

Considering [length 4 / frequency 2] ccac=d.

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

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