Morphocompletion for #4136 ⟨a, b | aababbaba=ab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abbbaba ⇒ aababbb
2.	aababbaba ⇒ ab
3.	abbbbaba ⇒ abababbb
4.	abbabbaba ⇒ aababbabb
5.	abababbaba ⇒ abb
6.	abbbbbaba ⇒ abbababbb
7.	abbbabbaba ⇒ abababbabb
8.	abbababbaba ⇒ abbb
9.	abbbbbbaba ⇒ aababbbbbb
10.	abbbbabbaba ⇒ abbababbabb
11.	abbbbbbbaba ⇒ abababbbbbb
12.	abbbbbabbaba ⇒ aababbbbbabb
13.	abbbbbbbbaba ⇒ abbababbbbbb
14.	abbbbbbabbaba ⇒ abababbbbbabb
15.	abbbbbbbbbaba ⇒ aababbbbbbbbb
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] bb, [2/1] ba, [2/2] ab, [2/3] aa
Length 3:	[3/0] bbb, [3/1] aba, [3/2] abb, [3/3] bab, [3/4] bba, [3/5] aab
Length 4:	[4/0] baba, [4/1] bbbb, [4/2] abbb, [4/3] bbab, [4/4] abba, [4/5] bbba, [4/6] babb
Length 5:	[5/0] bbaba, [5/1] bbbbb, [5/2] abbbb, [5/3] abbab, [5/4] bbbab, [5/5] bbbba, [5/6] babba
Length 6:	[6/0] abbaba, [6/1] abbbbb, [6/2] bbbaba, [6/3] bbbbbb, [6/4] bbbbab, [6/5] babbab, [6/6] bbbbba
Length 7:	[7/0] babbaba, [7/1] bbbbaba, [7/2] abbbbbb, [7/3] bbbbbab, [7/4] bbbbbbb, [7/5] bbbbbba, [7/6] bbabbab

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

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

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