Morphocompletion for #3929 ⟨a, b | aaaabbaaa=ba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

Collecting factors up to length 8 / frequency 7:

[2/0]	aa	57	`lf:47,lp:7,ls:3,rf:19,rp:5,rs:2,lsrp:2,lprs:2`
[2/1]	ba	41	`lf:27,lp:5,ls:9,rf:15,rp:2,rs:10,re:1,lsrp:1,lprs:5,lsrs:7`
[2/2]	ab	22	`lf:22,rf:8`
[2/3]	bb	20	`lf:20,rf:25,rp:5`
[3/0]	aaa	33	`lf:23,lp:7,ls:3,rf:12,rp:5,rs:2,lsrp:2,lprs:2`
[3/1]	baa	22	`lf:17,lp:5,rf:2`
[3/2]	bba	21	`lf:16,ls:5,rf:12,rp:1,rs:8,re:1,lsrs:4`
[3/3]	aab	21	`lf:21,rf:5`
[3/4]	abb	16	`lf:16,rf:7`
[3/5]	aba	10	`lf:6,ls:4,rf:1,rs:1,a:2`
[3/6]	bbb	4	`lf:4,rf:13,rp:4,a:1`
[4/0]	aabb	16	`lf:16,rf:5`
[4/1]	aaaa	16	`lf:9,lp:7,rf:5,rp:5`
[4/2]	abba	15	`lf:13,ls:2,rf:4,rs:1`
[4/3]	baab	13	`lf:10,lp:3,a:1`
[4/4]	baaa	12	`lf:7,lp:2,ls:3,rf:2,rs:2`
[4/5]	aaab	11	`lf:11,rf:5`
[4/6]	bbaa	10	`lf:10,rf:2`
[5/0]	aaaab	16	`lf:9,lp:7,rf:5,rp:5`
[5/1]	aabba	15	`lf:13,ls:2,rf:2`
[5/2]	baabb	10	`lf:7,lp:3,a:1`
[5/3]	abbaa	10	`lf:10,rf:1`
[5/4]	aaabb	9	`lf:9,rf:5`
[5/5]	bbaab	7	`lf:7,a:3`
[5/6]	bbaaa	6	`lf:3,ls:3,rf:2,rs:2`
[6/0]	aaaabb	12	`lf:7,lp:5,rf:5,rp:5`
[6/1]	baabba	10	`lf:5,lp:3,ls:2,a:1`
[6/2]	aabbaa	10	`lf:10`
[6/3]	aaabba	8	`lf:8,rf:2`
[6/4]	abbaab	7	`lf:7,a:3`
[6/5]	bbaaba	6	`lf:3,ls:3,a:3`
[6/6]	abbaaa	6	`lf:3,ls:3,rf:1,rs:1`
[7/0]	aaaabba	11	`lf:6,lp:5,rf:2,rp:2`
[7/1]	aabbaab	7	`lf:7,a:3`
[7/2]	aaabbaa	7	`lf:7`
[7/3]	baabbaa	6	`lf:3,lp:3,a:1`
[7/4]	abbaaba	6	`lf:3,ls:3,a:3`
[7/5]	aabbaaa	6	`lf:3,ls:3`
[7/6]	bbaabba	4	`lf:2,ls:2,a:6`

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

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

Rewriting system is complete. See ⟨a, b | aaaabbaaa=ba⟩.