Morphocompletion for #4853 ⟨a, b | abbaaaab=aaa⟩

Solved by morph:3/2. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Right-to-left recursive path with deg(a) = 0; deg(b) = 1

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abbaaaaaa ⇒ aaabaaaab
2.	abbaaaab ⇒ aaa
3.	aaaaaaabbbaaaaaa ⇒ aaaaaaabaabaaaab
4.	aaaaaaabbbaaaab ⇒ aaaaaaabaa
5.	aaaaaaababbbaaaab ⇒ aaaaaaababaa
6.	aaabaaaabbbaaaab ⇒ aaabaaaabaa
7.	aaabaaaababbbaaaab ⇒ aaabaaaababaa
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	aa	60	`lf:53,lp:5,ls:2,rf:43,rp:7,rs:5,lprp:5,lsrp:2,lprs:4`
[2/1]	ab	23	`lf:16,lp:2,ls:5,rf:13,rs:2,lprs:1`
[2/2]	bb	12	`lf:12`
[2/3]	ba	11	`lf:11,rf:11`
[3/0]	aaa	46	`lf:39,lp:5,ls:2,rf:27,rp:7,rs:1,re:1,lprp:5,lsrp:2`
[3/1]	aab	17	`lf:12,ls:5,rf:11,rs:2`
[3/2]	abb	9	`lf:7,lp:2`
[3/3]	baa	9	`lf:9,rf:9,rs:4`
[3/4]	bba	7	`lf:7`
[3/5]	bbb	5	`lf:5,a:2`
[3/6]	aba	4	`lf:4,rf:11,a:1`
[4/0]	aaaa	30	`lf:25,lp:3,ls:2,rf:16,rp:3,lprp:3,lsrp:1`
[4/1]	aaab	19	`lf:12,lp:2,ls:5,rf:10,rp:3,rs:2,lprp:2,lsrp:2`
[4/2]	baaa	9	`lf:9,rf:4`
[4/3]	bbaa	7	`lf:7`
[4/4]	bbba	5	`lf:5,a:2`
[4/5]	abbb	5	`lf:5,a:2`
[4/6]	abba	4	`lf:2,lp:2`
[5/0]	aaaaa	18	`lf:13,lp:3,ls:2,rf:9,rp:3,lprp:3,lsrp:1,a:1`
[5/1]	aaaab	15	`lf:10,ls:5,rf:7,rs:2`
[5/2]	baaaa	9	`lf:9,rf:4`
[5/3]	bbaaa	7	`lf:7`
[5/4]	aaaba	6	`lf:4,lp:2,rf:8,rp:3,lprp:2,a:1`
[5/5]	bbbaa	5	`lf:5,a:2`
[5/6]	abbba	5	`lf:5,a:2`
[6/0]	aaaaaa	13	`lf:8,lp:3,ls:2,rf:6,rp:3,lprp:3,lsrp:1,a:1`
[6/1]	baaaab	12	`lf:7,ls:5,rf:4,rs:2`
[6/2]	bbaaaa	7	`lf:7`
[6/3]	bbbaaa	5	`lf:5,a:2`
[6/4]	abbbaa	5	`lf:5,a:2`
[6/5]	abbaaa	4	`lf:2,lp:2`
[6/6]	aaabaa	4	`lf:2,lp:2,rf:6,rp:3,rs:2,lprp:2,lprs:1,a:1`
[7/0]	bbaaaab	10	`lf:5,ls:5`
[7/1]	aaaaaaa	6	`lf:3,lp:3,rf:3,rp:3,lprp:3,a:4`
[7/2]	bbbaaaa	5	`lf:5,a:2`
[7/3]	abbbaaa	5	`lf:5,a:2`
[7/4]	abbaaaa	4	`lf:2,lp:2`
[7/5]	baaaaaa	4	`lf:2,ls:2,a:1`
[7/6]	aaabaaa	4	`lf:2,lp:2,rf:3,rp:3,lprp:2,a:1`

Considering [length 3 / frequency 2] abb=c.

Step 2

Auxiliary generators:
1. c = abb
Reduction order:
- Right-to-left recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1

Rewriting system is complete. See ⟨a, b | abbaaaab=aaa⟩.