Morphocompletion for #2232 ⟨a, b | aababaa=aab⟩

Solved by morph:5/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.	aababaa ⇒ aab
2.	aabbabaa ⇒ aabb
3.	aabababaa ⇒ aabab
4.	aabbbabaa ⇒ aabbb
5.	aababbabaa ⇒ aababb
6.	aabbababaa ⇒ aabbab
7.	aabbbbabaa ⇒ aabbbb
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	aa	28	`lf:14,lp:7,ls:7,rf:7,rp:7,lprp:7,lsrp:7`
[2/1]	ba	17	`lf:17,rf:3`
[2/2]	ab	17	`lf:17,rf:10,rs:3`
[2/3]	bb	8	`lf:8,rf:8,rs:4,a:1`
[3/0]	baa	14	`lf:7,ls:7`
[3/1]	aab	14	`lf:7,lp:7,rf:7,rp:7,rs:1,re:1,lprp:7,lprs:1`
[3/2]	aba	12	`lf:12,rf:2`
[3/3]	bab	10	`lf:10,rf:3,rs:2`
[3/4]	bba	5	`lf:5,rf:1,a:1`
[3/5]	abb	5	`lf:5,rf:5,rs:2,a:1`
[3/6]	bbb	3	`lf:3,rf:3,rs:2,a:3`
[4/0]	abaa	14	`lf:7,ls:7`
[4/1]	baba	9	`lf:9`
[4/2]	aabb	8	`lf:4,lp:4,rf:4,rp:4,rs:1,re:1,lprp:4,lprs:1,a:1`
[4/3]	aaba	6	`lf:3,lp:3,rf:2,rp:2,lprp:2`
[4/4]	bbab	5	`lf:5,rf:1,rs:1,a:1`
[4/5]	abab	5	`lf:5,rf:2,rs:1`
[4/6]	abba	3	`lf:3,rf:1,a:1`
[5/0]	babaa	14	`lf:7,ls:7`
[5/1]	aabab	6	`lf:3,lp:3,rf:2,rp:2,rs:1,re:1,lprp:2,lprs:1`
[5/2]	bbaba	5	`lf:5,a:1`
[5/3]	ababa	4	`lf:4`
[5/4]	aabbb	4	`lf:2,lp:2,rf:2,rp:2,rs:1,re:1,lprp:2,lprs:1,a:3`
[5/5]	aabba	4	`lf:2,lp:2,rf:1,rp:1,lprp:1,a:1`
[5/6]	abbab	3	`lf:3,rf:1,rs:1,a:1`
[6/0]	bbabaa	8	`lf:4,ls:4,a:1`
[6/1]	ababaa	6	`lf:3,ls:3`
[6/2]	aabbab	4	`lf:2,lp:2,rf:1,rp:1,rs:1,re:1,lprp:1,lprs:1,a:1`
[6/3]	aababa	4	`lf:2,lp:2`
[6/4]	abbaba	3	`lf:3,a:1`
[6/5]	bbbaba	2	`lf:2,a:3`
[6/6]	bababa	2	`lf:2,a:2`
[7/0]	bbbabaa	4	`lf:2,ls:2,a:3`
[7/1]	bababaa	4	`lf:2,ls:2,a:2`
[7/2]	abbabaa	4	`lf:2,ls:2,a:1`
[7/3]	aabbaba	4	`lf:2,lp:2,a:1`
[7/4]	aabbbba	2	`lf:1,lp:1,a:6`
[7/5]	aabbbab	2	`lf:1,lp:1,a:3`
[7/6]	aababba	2	`lf:1,lp:1,a:4`

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

Step 2

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

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