Morphocompletion for #4876 ⟨a, b | abbabbba=bab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abbabbba ⇒ bab
2.	babbbabbba ⇒ abbabbbbab
3.	ababbabbbbab ⇒ babbbba
4.	babbbbababbba ⇒ ababbabbbbbab
5.	abbabbbbabbbba ⇒ babbabbabbbbab
6.	ababababbabbbbbab ⇒ babbbbaabbba
7.	abbabbabbabbbbab ⇒ babbbbabbba
8.	ababbabbbbbabbbba ⇒ babbbbaabbabbbbab
9.	babbbbabbbababbba ⇒ abbabbabbabbbbbab
10.	abbabbababbabbbbbab ⇒ babbbbbababbba
	...

Collecting factors up to length 7, frequency 4:

Considering [length 2 / frequency 1] ab=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] bc, [2/1] cb, [2/2] bb, [2/3] ba, [2/4] cc, [2/5] ac
Length 3:	[3/0] bbc, [3/1] cbb, [3/2] bcb, [3/3] bba, [3/4] cbc, [3/5] ccb, [3/6] bbb
Length 4:	[4/0] bcbb, [4/1] cbbc, [4/2] bbbc, [4/3] cbcb, [4/4] cbba, [4/5] cbbb, [4/6] ccbb
Length 5:	[5/0] bcbbb, [5/1] cbcbb, [5/2] cbbbc, [5/3] ccbbc, [5/4] bcbbc, [5/5] bbcbb, [5/6] bcbba

Considering [length 3 / frequency 1] cbb=d.

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

Rewriting system is complete. See ⟨a, b | abbabbba=bab⟩.