Morphocompletion for #4176 ⟨a, b | aabbababa=ab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabbababa ⇒ ab
2.	ababbababa ⇒ abb
3.	aabbababb ⇒ abbbababa
4.	abbabbababa ⇒ abbb
5.	ababbababb ⇒ abbbbababa
6.	abbbabbababa ⇒ abbbb
7.	abbbababaababa ⇒ aabbabb
8.	abbabbababb ⇒ abbbbbababa
9.	abbbbabbababa ⇒ abbbbb
10.	abbbbababaababa ⇒ ababbabb
11.	abbbabbababb ⇒ abbbbbbababa
12.	abbbbbabbababa ⇒ abbbbbb
13.	abbbbbababaababa ⇒ abbabbabb
14.	abbbbabbababb ⇒ abbbbbbbababa
15.	abbbbbbabbababa ⇒ abbbbbbb
16.	abbbbbbbabbababa ⇒ 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] aba, [3/1] abb, [3/2] bab, [3/3] bba, [3/4] bbb, [3/5] aab, [3/6] baa
Length 4:	[4/0] baba, [4/1] bbab, [4/2] abab, [4/3] babb, [4/4] abbb, [4/5] abba, [4/6] bbbb
Length 5:	[5/0] ababa, [5/1] abbab, [5/2] babab, [5/3] bbaba, [5/4] abbbb, [5/5] ababb, [5/6] babba
Length 6:	[6/0] bababa, [6/1] bbabab, [6/2] abbaba, [6/3] babbab, [6/4] bababb, [6/5] bbabba, [6/6] abbbbb
Length 7:	[7/0] bbababa, [7/1] abbabab, [7/2] babbaba, [7/3] bbababb, [7/4] bbabbab, [7/5] bbbabba, [7/6] abbbbab

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

Reduction order:
- Left-to-right 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 | aabbababa=ab⟩.