Morphocompletion for #5277 ⟨a, b | aabbbba=bbaa⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabbbba ⇒ bbaa
2.	aabbbbbbaa ⇒ bbabbaa
3.	aabbbbbbbbaa ⇒ bbabbbbaa
4.	aabbbbbbabbaa ⇒ bbabbabbaa
5.	aabbbbbbbbbbaa ⇒ bbabbbbbbaa
6.	aabbbbbbabbbbaa ⇒ bbabbabbbbaa
7.	aabbbbbbbbabbaa ⇒ bbabbbbabbaa
	...

Collecting factors up to length 7, frequency 3:

Considering [length 4 / frequency 0] bbbb=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] aa, [2/1] bb, [2/2] ca, [2/3] ac, [2/4] cc
Length 3:	[3/0] caa, [3/1] bbc, [3/2] aca, [3/3] bba, [3/4] cca
Length 4:	[4/0] ccaa, [4/1] bbac, [4/2] acaa, [4/3] aaca, [4/4] bbcc
Length 5:	[5/0] cccaa, [5/1] aacac, [5/2] cacaa, [5/3] accaa, [5/4] bbaca

Considering [length 3 / frequency 0] caa=d.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] ca, [2/1] aa, [2/2] bb, [2/3] ad, [2/4] ac
Length 3:	[3/0] aca, [3/1] cad, [3/2] cac, [3/3] acd, [3/4] aac
Length 4:	[4/0] cacd, [4/1] caca, [4/2] aaca, [4/3] acac, [4/4] daca
Length 5:	[5/0] acacd, [5/1] acaca, [5/2] dacac, [5/3] aacac, [5/4] aadac

Considering [length 3 / frequency 0] aca=e.

Reduction order:
- Right-to-left recursive path with deg(a) = deg(e) = deg(d) = 0, a < e < d; deg(c) = deg(b) = 1, c < b
Auxiliary generators:
1. bbbb=c
2. caa=d
3. aca=e

Rewriting system is complete. See ⟨a, b | aabbbba=bbaa⟩.