Morphocompletion for #3920 ⟨a, b | aaaababba=ab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaaababba ⇒ ab
2.	abaababba ⇒ aaaababbb
3.	abaaababba ⇒ abb
4.	abbaababba ⇒ abaaababbb
5.	abbaaababba ⇒ abbb
6.	aaaababaaababbb ⇒ abababba
7.	abbbaababba ⇒ abbaaababbb
8.	abbbaaababba ⇒ abbbb
9.	abaaababaaababbb ⇒ abbababba
10.	abbbbaababba ⇒ abbbaaababbb
11.	abbbbaaababba ⇒ abbbbb
12.	abbaaababaaababbb ⇒ abbbababba
13.	abbbbbaababba ⇒ abbbbaaababbb
14.	abbbbbaaababba ⇒ abbbbbb
15.	abbbbbbaaababba ⇒ abbbbbbb
16.	abbbbbbbaaababba ⇒ abbbbbbbb
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ab, [2/1] ba, [2/2] bb, [2/3] aa
Length 3:	[3/0] abb, [3/1] bba, [3/2] aba, [3/3] bbb, [3/4] bab, [3/5] aab, [3/6] aaa
Length 4:	[4/0] abba, [4/1] abbb, [4/2] abab, [4/3] aaba, [4/4] babb, [4/5] aaab, [4/6] bbbb
Length 5:	[5/0] babba, [5/1] aabab, [5/2] ababb, [5/3] aaaba, [5/4] abbbb, [5/5] baaab, [5/6] bbbaa
Length 6:	[6/0] ababba, [6/1] aababb, [6/2] aaabab, [6/3] baaaba, [6/4] abbbbb, [6/5] bbaaab, [6/6] abaaab
Length 7:	[7/0] aababba, [7/1] baaabab, [7/2] aaababb, [7/3] bbaaaba, [7/4] abaaaba, [7/5] aababbb, [7/6] bbbaaab

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

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

Rewriting system is complete. See ⟨a, b | aaaababba=ab⟩.