Morphocompletion for #4566 ⟨a, b | aaabbbaa=aab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right recursive path with deg(a) = 0; deg(b) = 1

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaabbbaa ⇒ aab
2.	aababbbaa ⇒ aabb
3.	aabaabbbaa ⇒ aabab
4.	aabbabbbaa ⇒ aabbb
5.	aabbaabbbaa ⇒ aabbab
6.	aabababbbaa ⇒ aababb
7.	aabbbabbbaa ⇒ aabbbb
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	aa	31	`lf:17,lp:7,ls:7,rf:7,rp:7,lprp:7,lsrp:7`
[2/1]	bb	18	`lf:18,rf:8,rs:4`
[2/2]	ab	14	`lf:14,rf:10,rs:3`
[2/3]	ba	14	`lf:14,rf:3`
[3/0]	baa	16	`lf:9,ls:7`
[3/1]	aab	15	`lf:9,lp:6,rf:7,rp:7,rs:1,re:1,lprp:6`
[3/2]	abb	10	`lf:10,rf:5,rs:2`
[3/3]	bba	10	`lf:10,rf:1`
[3/4]	bbb	8	`lf:8,rf:3,rs:2`
[3/5]	bab	5	`lf:5,rf:3,rs:2,a:1`
[3/6]	aba	4	`lf:4,rf:2,a:1`
[4/0]	bbaa	15	`lf:8,ls:7`
[4/1]	aabb	9	`lf:6,lp:3,rf:4,rp:4,rs:1,re:1,lprp:3`
[4/2]	abbb	8	`lf:8,rf:2,rs:1`
[4/3]	bbba	8	`lf:8`
[4/4]	aaba	6	`lf:3,lp:3,rf:2,rp:2,lprp:2,a:1`
[4/5]	babb	4	`lf:4,rf:1,rs:1,a:1`
[4/6]	abab	3	`lf:3,rf:2,rs:1,a:1`
[5/0]	bbbaa	14	`lf:7,ls:7`
[5/1]	abbba	8	`lf:8`
[5/2]	aabbb	5	`lf:4,lp:1,rf:2,rp:2,rs:1,re:1,lprp:1`
[5/3]	babbb	4	`lf:4,a:1`
[5/4]	aabab	4	`lf:2,lp:2,rf:2,rp:2,rs:1,re:1,lprp:1,a:1`
[5/5]	aabba	4	`lf:2,lp:2,rf:1,rp:1,lprp:1,a:3`
[5/6]	bbabb	2	`lf:2,a:3`
[6/0]	abbbaa	14	`lf:7,ls:7`
[6/1]	aabbba	5	`lf:4,lp:1`
[6/2]	babbba	4	`lf:4,a:1`
[6/3]	bbabbb	2	`lf:2,a:3`
[6/4]	ababbb	2	`lf:2,a:1`
[6/5]	baabbb	2	`lf:2,a:2`
[6/6]	aaabbb	2	`lf:1,lp:1`
[7/0]	babbbaa	8	`lf:4,ls:4,a:1`
[7/1]	aabbbaa	6	`lf:3,ls:3`
[7/2]	bbabbba	2	`lf:2,a:3`
[7/3]	aababbb	2	`lf:1,lp:1,a:1`
[7/4]	aabbabb	2	`lf:1,lp:1,a:3`
[7/5]	aabbbab	2	`lf:1,lp:1,a:6`
[7/6]	ababbba	2	`lf:2,a:1`

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

Step 2

Auxiliary generators:
1. c = bbbaa
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 | aaabbbaa=aab⟩.