Morphocompletion for #4508 ⟨a, b | aaababaa=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.	aaababaa ⇒ aab
2.	aabababaa ⇒ aabb
3.	aabaababaa ⇒ aabab
4.	aabbbabaaaa ⇒ aababb
5.	aabbababaa ⇒ aabbb
6.	aabbaababaa ⇒ aabbab
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	aa	29	`lf:17,lp:6,ls:6,rf:6,rp:6,lprp:6,lsrp:6`
[2/1]	ab	16	`lf:16,rf:9,rs:3`
[2/2]	ba	16	`lf:16,rf:3`
[2/3]	bb	4	`lf:4,rf:5,rs:3,a:1`
[3/0]	aab	13	`lf:8,lp:5,rf:6,rp:6,rs:1,re:1,lprp:5`
[3/1]	aba	13	`lf:13,rf:2`
[3/2]	baa	13	`lf:8,ls:5`
[3/3]	bab	8	`lf:8,rf:3,rs:2`
[3/4]	aaa	5	`lf:3,lp:1,ls:1`
[3/5]	abb	3	`lf:3,rf:4,rs:2,a:1`
[3/6]	bba	3	`lf:3,rf:1,a:3`
[4/0]	abaa	12	`lf:7,ls:5`
[4/1]	baba	8	`lf:8`
[4/2]	aaba	7	`lf:5,lp:2,rf:2,rp:2,lprp:1`
[4/3]	aabb	6	`lf:3,lp:3,rf:3,rp:3,rs:1,re:1,lprp:2,a:1`
[4/4]	abab	6	`lf:6,rf:2,rs:1`
[4/5]	bbab	2	`lf:2,rf:1,rs:1,a:3`
[4/6]	abba	2	`lf:2,rf:1,a:3`
[5/0]	babaa	11	`lf:6,ls:5`
[5/1]	ababa	6	`lf:6`
[5/2]	aabab	5	`lf:4,lp:1,rf:2,rp:2,rs:1,re:1`
[5/3]	aabba	4	`lf:2,lp:2,rf:1,rp:1,lprp:1,a:3`
[5/4]	aabbb	2	`lf:1,lp:1,rf:1,rp:1,rs:1,re:1,a:3`
[5/5]	babab	2	`lf:2,a:1`
[5/6]	bbaba	2	`lf:2,a:3`
[6/0]	ababaa	10	`lf:5,ls:5`
[6/1]	aababa	5	`lf:4,lp:1`
[6/2]	aabbab	2	`lf:1,lp:1,rf:1,rp:1,rs:1,re:1,a:3`
[6/3]	aabbba	2	`lf:1,lp:1,a:4`
[6/4]	baabab	2	`lf:2,a:2`
[6/5]	bababa	2	`lf:2,a:1`
[6/6]	aaabab	2	`lf:1,lp:1`
[7/0]	aababaa	6	`lf:3,ls:3`
[7/1]	bababaa	4	`lf:2,ls:2,a:1`
[7/2]	aabbbab	2	`lf:1,lp:1,a:4`
[7/3]	aababab	2	`lf:1,lp:1,a:1`
[7/4]	aabbaab	2	`lf:1,lp:1,a:5`
[7/5]	aabbaba	2	`lf:1,lp:1,a:3`
[7/6]	baababa	2	`lf:2,a:2`

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

Step 2

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