Morphocompletion for #4000 ⟨a, b | aaababbaa=ba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaababbaa ⇒ ba
2.	aaababbaba ⇒ bba
3.	baababbaa ⇒ aaababbba
4.	aaababbabba ⇒ bbba
5.	baababbaba ⇒ aaababbbba
6.	aaababbabbba ⇒ bbbba
7.	aaababaaababbba ⇒ bababbaa
8.	baababbabba ⇒ aaababbbbba
9.	aaababbabbbba ⇒ bbbbba
10.	aaababaaababbbba ⇒ bababbaba
11.	baababbabbba ⇒ aaababbbbbba
12.	aaababbabbbbba ⇒ bbbbbba
13.	aaababaaababbbbba ⇒ bababbabba
14.	baababbabbbba ⇒ aaababbbbbbba
15.	aaababbabbbbbba ⇒ bbbbbbba
16.	aaababbabbbbbbba ⇒ bbbbbbbba
17.	aaababbabbbbbbbba ⇒ bbbbbbbbba
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ba, [2/1] bb, [2/2] ab, [2/3] aa
Length 3:	[3/0] bba, [3/1] bab, [3/2] bbb, [3/3] abb, [3/4] aba, [3/5] aaa, [3/6] aab
Length 4:	[4/0] babb, [4/1] aaab, [4/2] bbba, [4/3] abab, [4/4] aaba, [4/5] bbbb, [4/6] abba
Length 5:	[5/0] aaaba, [5/1] aabab, [5/2] babba, [5/3] ababb, [5/4] bbbba, [5/5] abbab, [5/6] bbbbb
Length 6:	[6/0] aaabab, [6/1] aababb, [6/2] ababba, [6/3] babbab, [6/4] bbbbba, [6/5] abbabb, [6/6] baabab
Length 7:	[7/0] aaababb, [7/1] aababba, [7/2] ababbab, [7/3] babbabb, [7/4] baababb, [7/5] abbabbb, [7/6] bbbbbba

Considering [length 3 / frequency 0] bba=c.

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

Rewriting system is complete. See ⟨a, b | aaababbaa=ba⟩.