Morphocompletion for #4511 ⟨a, b | aaababaa=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.	aaababaa ⇒ baa
2.	aaababbaa ⇒ bbaa
3.	aaabababaa ⇒ babaa
4.	aaababbbaa ⇒ bbbaa
5.	aaabababbaa ⇒ babbaa
6.	aaababbabaa ⇒ bbabaa
7.	aaababbbbaa ⇒ bbbbaa
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	aa	35	`lf:21,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	8	`lf:8,rf:8,rp:4,a:1`
[3/0]	baa	14	`lf:7,ls:7,rf:7,rp:1,rs:7,re:1,lsrp:1,lsrs:7`
[3/1]	aaa	14	`lf:7,lp:7`
[3/2]	aba	12	`lf:12,rf:2`
[3/3]	bab	10	`lf:10,rf:3,rp:2`
[3/4]	aab	7	`lf:7`
[3/5]	bba	5	`lf:5,rf:5,rp:2,a:1`
[3/6]	abb	5	`lf:5,rf:1,a:1`
[4/0]	aaab	14	`lf:7,lp:7`
[4/1]	abab	9	`lf:9`
[4/2]	bbaa	8	`lf:4,ls:4,rf:4,rp:1,rs:4,re:1,lsrp:1,lsrs:4,a:1`
[4/3]	aaba	7	`lf:7`
[4/4]	abaa	6	`lf:3,ls:3,rf:2,rs:2,lsrs:2`
[4/5]	babb	5	`lf:5,rf:1,rp:1,a:1`
[4/6]	baba	5	`lf:5,rf:2,rp:1`
[5/0]	aaaba	14	`lf:7,lp:7`
[5/1]	aabab	7	`lf:7`
[5/2]	babaa	6	`lf:3,ls:3,rf:2,rp:1,rs:2,re:1,lsrp:1,lsrs:2`
[5/3]	ababb	5	`lf:5,a:1`
[5/4]	bbbaa	4	`lf:2,ls:2,rf:2,rp:1,rs:2,re:1,lsrp:1,lsrs:2,a:3`
[5/5]	abbaa	4	`lf:2,ls:2,rf:1,rs:1,lsrs:1,a:1`
[5/6]	ababa	4	`lf:4`
[6/0]	aaabab	14	`lf:7,lp:7`
[6/1]	babbaa	4	`lf:2,ls:2,rf:1,rp:1,rs:1,re:1,lsrp:1,lsrs:1,a:1`
[6/2]	ababaa	4	`lf:2,ls:2`
[6/3]	aababb	4	`lf:4,a:1`
[6/4]	ababba	3	`lf:3,a:1`
[6/5]	aababa	3	`lf:3`
[6/6]	bbbbaa	2	`lf:1,ls:1,rf:1,rp:1,rs:1,re:1,lsrp:1,lsrs:1,a:6`
[7/0]	aaababb	8	`lf:4,lp:4,a:1`
[7/1]	aaababa	6	`lf:3,lp:3`
[7/2]	ababbaa	4	`lf:2,ls:2,a:1`
[7/3]	babbbaa	2	`lf:1,ls:1,a:3`
[7/4]	bababaa	2	`lf:1,ls:1,a:2`
[7/5]	abbbbaa	2	`lf:1,ls:1,a:6`
[7/6]	abbabaa	2	`lf:1,ls:1,a:5`

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

Step 2

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

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