Morphocompletion for #4659 ⟨a, b | aababbaa=baa⟩

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.	aababbaa ⇒ baa
2.	aababbbaa ⇒ bbaa
3.	aababbabaa ⇒ babaa
4.	aababbbbaa ⇒ bbbaa
5.	aababbabbaa ⇒ babbaa
6.	aababbbabaa ⇒ bbabaa
7.	aababbbbbaa ⇒ bbbbaa
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	aa	28	`lf:14,lp:7,ls:7,rf:7,rs:7,lprs:7,lsrs:7`
[2/1]	ba	17	`lf:17,rf:10,rp:3`
[2/2]	ab	17	`lf:17,rf:3`
[2/3]	bb	15	`lf:15,rf:8,rp:4`
[3/0]	baa	14	`lf:7,ls:7,rf:7,rp:1,rs:7,re:1,lsrp:1,lsrs:7`
[3/1]	aab	14	`lf:7,lp:7`
[3/2]	bab	10	`lf:10,rf:3,rp:2`
[3/3]	aba	9	`lf:9,rf:2`
[3/4]	bba	8	`lf:8,rf:5,rp:2`
[3/5]	abb	8	`lf:8,rf:1`
[3/6]	bbb	7	`lf:7,rf:3,rp:2,a:1`
[4/0]	aaba	14	`lf:7,lp:7`
[4/1]	bbaa	10	`lf:5,ls:5,rf:4,rp:1,rs:4,re:1,lsrp:1,lsrs:4`
[4/2]	babb	8	`lf:8,rf:1,rp:1`
[4/3]	abab	7	`lf:7`
[4/4]	bbba	4	`lf:4,rf:2,rp:1,a:1`
[4/5]	abbb	4	`lf:4,a:1`
[4/6]	abba	4	`lf:4,rf:1`
[5/0]	aabab	14	`lf:7,lp:7`
[5/1]	ababb	7	`lf:7`
[5/2]	bbbaa	6	`lf:3,ls:3,rf:2,rp:1,rs:2,re:1,lsrp:1,lsrs:2,a:1`
[5/3]	babbb	4	`lf:4,a:1`
[5/4]	babba	4	`lf:4,rf:1,rp:1`
[5/5]	babaa	4	`lf:2,ls:2,rf:2,rp:1,rs:2,re:1,lsrp:1,lsrs:2,a:2`
[5/6]	abbaa	4	`lf:2,ls:2,rf:1,rs:1,lsrs:1`
[6/0]	aababb	14	`lf:7,lp:7`
[6/1]	bbbbaa	4	`lf:2,ls:2,rf:1,rp:1,rs:1,re:1,lsrp:1,lsrs:1,a:3`
[6/2]	bbabaa	4	`lf:2,ls:2,rf:1,rp:1,rs:1,re:1,lsrp:1,lsrs:1,a:2`
[6/3]	babbaa	4	`lf:2,ls:2,rf:1,rp:1,rs:1,re:1,lsrp:1,lsrs:1`
[6/4]	ababbb	4	`lf:4,a:1`
[6/5]	ababba	3	`lf:3`
[6/6]	babbbb	2	`lf:2,a:3`
[7/0]	aababbb	8	`lf:4,lp:4,a:1`
[7/1]	aababba	6	`lf:3,lp:3`
[7/2]	bbbbbaa	2	`lf:1,ls:1,a:6`
[7/3]	bbbabaa	2	`lf:1,ls:1,a:5`
[7/4]	bbabbaa	2	`lf:1,ls:1,a:4`
[7/5]	babbbaa	2	`lf:1,ls:1,a:1`
[7/6]	abbbbaa	2	`lf:1,ls:1,a:3`

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

Step 2

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

Rewriting system is complete. See ⟨a, b | aababbaa=baa⟩.