Morphocompletion for #4732 ⟨a, b | aabbbbaa=aab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right shortlex with a < b

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabbbbaa ⇒ aab
2.	aabbbbbaa ⇒ aabb
3.	aababbbbaa ⇒ aabab
4.	aabbbbbbaa ⇒ aabbb
5.	aababbbbbaa ⇒ aababb
6.	aabbabbbbaa ⇒ aabbab
7.	aabbbbbbbaa ⇒ aabbbb
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	bb	29	`lf:29,rf:8,rs:4`
[2/1]	aa	28	`lf:14,lp:7,ls:7,rf:7,rp:7,lprp:7,lsrp:7`
[2/2]	ba	10	`lf:10,rf:3`
[2/3]	ab	10	`lf:10,rf:10,rs:3`
[3/0]	bbb	21	`lf:21,rf:3,rs:2`
[3/1]	baa	14	`lf:7,ls:7`
[3/2]	aab	14	`lf:7,lp:7,rf:7,rp:7,rs:1,re:1,lprp:7,lprs:1`
[3/3]	bba	8	`lf:8,rf:1`
[3/4]	abb	8	`lf:8,rf:5,rs:2`
[3/5]	bab	3	`lf:3,rf:3,rs:2,a:2`
[3/6]	aba	2	`lf:2,rf:2,a:2`
[4/0]	bbbb	14	`lf:14,rf:1,rs:1`
[4/1]	bbaa	14	`lf:7,ls:7`
[4/2]	aabb	10	`lf:5,lp:5,rf:4,rp:4,rs:1,re:1,lprp:4,lprs:1`
[4/3]	bbba	7	`lf:7`
[4/4]	abbb	7	`lf:7,rf:2,rs:1`
[4/5]	aaba	4	`lf:2,lp:2,rf:2,rp:2,lprp:2,a:2`
[4/6]	babb	3	`lf:3,rf:1,rs:1,a:2`
[5/0]	bbbaa	14	`lf:7,ls:7`
[5/1]	aabbb	8	`lf:4,lp:4,rf:2,rp:2,rs:1,re:1,lprp:2,lprs:1`
[5/2]	bbbbb	7	`lf:7,a:1`
[5/3]	bbbba	7	`lf:7`
[5/4]	abbbb	7	`lf:7,rf:1,rs:1`
[5/5]	aabab	4	`lf:2,lp:2,rf:2,rp:2,rs:1,re:1,lprp:2,lprs:1,a:2`
[5/6]	babbb	3	`lf:3,a:2`
[6/0]	bbbbaa	14	`lf:7,ls:7`
[6/1]	aabbbb	8	`lf:4,lp:4,rf:1,rp:1,rs:1,re:1,lprp:1,lprs:1`
[6/2]	bbbbba	4	`lf:4,a:1`
[6/3]	abbbbb	4	`lf:4,a:1`
[6/4]	aababb	4	`lf:2,lp:2,rf:1,rp:1,rs:1,re:1,lprp:1,lprs:1,a:2`
[6/5]	bbbbbb	3	`lf:3,a:3`
[6/6]	babbbb	3	`lf:3,a:2`
[7/0]	bbbbbaa	8	`lf:4,ls:4,a:1`
[7/1]	abbbbaa	6	`lf:3,ls:3`
[7/2]	aabbbbb	6	`lf:3,lp:3,a:1`
[7/3]	aababbb	4	`lf:2,lp:2,a:2`
[7/4]	bbbbbba	2	`lf:2,a:3`
[7/5]	babbbba	2	`lf:2,a:2`
[7/6]	abbbbbb	2	`lf:2,a:3`

Considering [length 6 / frequency 0] bbbbaa=c.

Step 2

Auxiliary generators:
1. c = bbbbaa
Reduction order:
- Left-to-right shortlex with a < c < b

Rewriting system is complete. See ⟨a, b | aabbbbaa=aab⟩.