Morphocompletion for #4066 ⟨a, b | aabaaaaba=ab⟩

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]	ab	45	`lf:33,lp:8,ls:4,rf:20,rp:11,rs:2,re:1,lprp:7,lsrp:4,lprs:1`
[2/1]	aa	43	`lf:39,lp:4,rf:16,rp:1`
[2/2]	ba	33	`lf:27,ls:6,rf:14,rs:6`
[2/3]	bb	11	`lf:9,ls:2,rf:16,rs:4,a:2`
[3/0]	aba	33	`lf:23,lp:4,ls:6,rf:10,rp:2,rs:6,lprs:2`
[3/1]	aab	26	`lf:18,lp:4,ls:4,rf:9,rp:1,rs:1`
[3/2]	aaa	21	`lf:21,rf:7`
[3/3]	baa	14	`lf:14,rf:8`
[3/4]	abb	12	`lf:6,lp:4,ls:2,rf:8,rp:8,rs:1,re:1,lprp:4,lsrp:2,a:2`
[3/5]	bab	7	`lf:7,a:2`
[3/6]	bba	4	`lf:4,rf:4,a:3`
[4/0]	aaba	22	`lf:12,lp:4,ls:6,rf:8,rp:1,rs:6,lsrp:1,lprs:3`
[4/1]	aaab	15	`lf:12,ls:3,rf:5`
[4/2]	abaa	15	`lf:14,lp:1,rf:4,rp:2`
[4/3]	baaa	12	`lf:12,rf:5`
[4/4]	aaaa	9	`lf:9,rf:2`
[4/5]	baba	7	`lf:7,a:2`
[4/6]	abab	6	`lf:3,lp:3,a:2`
[5/0]	aaaba	13	`lf:7,ls:6,rf:5,rs:5`
[5/1]	abaaa	13	`lf:12,lp:1,rf:1,rp:1`
[5/2]	aabaa	10	`lf:6,lp:4,rf:2,rp:1`
[5/3]	aaaab	8	`lf:8,rf:2`
[5/4]	baaaa	8	`lf:8,rf:2`
[5/5]	baaab	7	`lf:4,ls:3,rf:3,a:1`
[5/6]	babaa	7	`lf:7,a:2`
[6/0]	aaaaba	12	`lf:6,ls:6,rf:2,rs:2`
[6/1]	abaaab	8	`lf:4,lp:1,ls:3,rf:1,rp:1,lsrp:10,a:1`
[6/2]	abaaaa	8	`lf:8`
[6/3]	baaaab	7	`lf:7,rf:2`
[6/4]	babaaa	7	`lf:7,a:2`
[6/5]	aabaaa	7	`lf:4,lp:3`
[6/6]	ababaa	6	`lf:3,lp:3,a:2`
[7/0]	baaaaba	10	`lf:5,ls:5,rf:2,rs:2`
[7/1]	abaaaab	7	`lf:7`
[7/2]	ababaaa	6	`lf:3,lp:3,a:2`
[7/3]	babaaaa	5	`lf:5,a:2`
[7/4]	aabaaaa	5	`lf:3,lp:2`
[7/5]	abbabaa	4	`lf:2,lp:2,a:4`
[7/6]	baaaabb	4	`lf:2,ls:2,a:3`

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

Auxiliary generators:
1. c = aaba
Reduction order:
- Left-to-right recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1

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