Morphocompletion for #4719 ⟨a, b | aabbbaab=baa⟩

Solved by morph:2/1,4/0. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabbbaab ⇒ baa
2.	baabbaab ⇒ aabbbbaa
3.	bbaabaabb ⇒ aabbbbbaa
4.	bbbaaaabbb ⇒ aabbbbbbaa
5.	aabaabbbbbaa ⇒ baaaabb
6.	aabbaabbbbaa ⇒ baabaab
7.	aabbbbaabbbaa ⇒ bbaabaab
8.	aabbbbbaabaab ⇒ bbaabbaa
9.	aabbbbbaabbbaa ⇒ bbbaaaabb
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	bb	36	`lf:32,lp:2,ls:2,rf:19,rp:3,rs:2`
[2/1]	aa	34	`lf:24,lp:6,ls:4,rf:19,rp:3,rs:5,lprs:2`
[2/2]	ab	21	`lf:18,ls:3,rf:10,rs:2`
[2/3]	ba	17	`lf:16,lp:1,rf:12,rp:3`
[3/0]	aab	27	`lf:18,lp:6,ls:3,rf:10,rp:3,rs:2,lsrp:1,lprs:2`
[3/1]	baa	21	`lf:16,lp:1,ls:4,rf:12,rp:3,rs:5,re:1,lsrp:2,lprs:1`
[3/2]	bbb	20	`lf:18,lp:1,ls:1,rf:10,rp:1`
[3/3]	bba	13	`lf:12,lp:1,rf:7,rp:2`
[4/0]	aabb	18	`lf:12,lp:5,ls:1,rf:6,rp:3,rs:2,lsrp:1,lprs:1`
[4/1]	bbaa	17	`lf:12,lp:1,ls:4,rf:7,rp:2,rs:4,lsrp:1,lprs:1`
[4/2]	baab	15	`lf:11,lp:1,ls:3,rf:5,rp:1,rs:2`
[4/3]	bbba	10	`lf:9,lp:1,rf:4,rp:1`
[5/0]	bbbaa	14	`lf:9,lp:1,ls:4,rf:4,rp:1,rs:3,lsrp:1,lprs:1`
[5/1]	aabbb	14	`lf:9,lp:4,ls:1,rf:3,rp:3,lsrp:1`
[5/2]	bbaab	10	`lf:7,lp:1,ls:2,rf:2,rp:2`
[5/3]	baabb	8	`lf:6,lp:1,ls:1,rf:1,a:1`
[6/0]	aabbbb	8	`lf:5,lp:3,rf:3,rp:3,a:1`
[6/1]	bbbbaa	7	`lf:5,ls:2,rf:3,rs:3,a:1`
[6/2]	aabaab	5	`lf:3,lp:1,ls:1,rf:2,rs:2,a:2`
[6/3]	abbbaa	5	`lf:3,ls:2`

Considering [length 2 / frequency 1] aa=c.

Step 2

Checking up to 20 rules for overlaps.

Auxiliary generators:
1. c = aa
Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(c) = 1; deg(a) = 2

Rewriting system is not complete: pendingRulesLimit

#	Rule
1.	cbbbcb ⇒ bc
2.	bcbbcb ⇒ cbbbbc
3.	bbcbcbb ⇒ cbbbbbc
4.	bbbccbbb ⇒ cbbbbbbc
5.	cbcbbbbbc ⇒ bccbb
6.	cbbcbbbbc ⇒ bcbcb
7.	cbbbbcbbbc ⇒ bbcbcb
8.	cbbbbbcbcb ⇒ bbcbbc
9.	cbbbbbcbbbc ⇒ bbbccbb
10.	cbbbbbbccb ⇒ bbbcbc
11.	bccbbbbbc ⇒ cbbbbccbb
12.	bcbcbbbbc ⇒ cbbbbcbcb
13.	bbccbbbbc ⇒ cbbbbbccb
14.	cbbcbbbbbcbbc ⇒ bbccb
15.	ca ⇒ ac
16.	bccbba ⇒ cbcbbbbbac
17.	bcbcba ⇒ cbbcbbbbac
18.	cbcbbbbcbbbac ⇒ bccba
19.	aa ⇒ c
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	bb	65	`lf:60,lp:3,ls:2,rf:41,rp:5,rs:3,a:2`
[2/1]	cb	46	`lf:33,lp:9,ls:4,rf:24,rp:8,rs:5,lsrp:1,lprs:3,a:2`
[2/2]	bc	45	`lf:32,lp:5,ls:8,rf:22,rp:4,rs:6,re:1,lsrp:2,lprs:1,a:2`
[2/3]	ba	5	`lf:3,ls:2,rf:3,rs:1,a:11`
[2/4]	cc	5	`lf:5,rf:6,a:15`
[2/5]	ac	2	`lf:1,ls:1,rf:3,rp:1,rs:3,re:1,a:3`
[3/0]	bbb	37	`lf:35,lp:1,ls:1,rf:23,rp:2,a:2`
[3/1]	bbc	31	`lf:21,lp:2,ls:8,rf:13,rp:3,rs:4,lsrp:2,lprs:1,a:2`
[3/2]	cbb	30	`lf:22,lp:7,ls:1,rf:13,rp:7,rs:3,lsrp:1,lprs:1,a:2`
[3/3]	bcb	25	`lf:19,lp:3,ls:3,rf:10,rp:1,rs:3,lprs:1,a:2`
[3/4]	cbc	8	`lf:6,lp:2,rf:5,rp:1,rs:1,a:5`
[3/5]	bcc	7	`lf:5,lp:2,rf:6,rp:2,a:15`
[3/6]	ccb	6	`lf:5,ls:1,rf:6,rs:2,a:15`
[4/0]	bbbc	23	`lf:15,lp:1,ls:7,rf:8,rp:2,rs:3,lsrp:1,lprs:1,a:2`
[4/1]	cbbb	22	`lf:16,lp:5,ls:1,rf:8,rp:6,lsrp:1,a:2`
[4/2]	bbbb	18	`lf:18,rf:13,a:4`
[4/3]	bbcb	13	`lf:10,lp:1,ls:2,rf:5,rp:2,a:2`
[4/4]	bcbb	13	`lf:11,lp:1,ls:1,rf:3,a:4`
[4/5]	cbcb	9	`lf:6,lp:2,ls:1,rf:4,rp:1,rs:3,a:5`
[4/6]	bccb	8	`lf:5,lp:2,ls:1,rf:6,rp:2,rs:2,a:15`
[5/0]	bbbbc	16	`lf:11,ls:5,rf:6,rs:3,a:4`
[5/1]	cbbbb	15	`lf:11,lp:4,rf:8,rp:6,a:4`
[5/2]	bcbbb	8	`lf:8,rf:2,a:5`
[5/3]	bcbcb	7	`lf:4,lp:2,ls:1,rf:3,rp:1,rs:3,re:1,lprs:1,a:5`
[5/4]	cbcbb	7	`lf:4,lp:2,ls:1,rf:1,rp:1,a:7`
[5/5]	bbbcb	7	`lf:6,ls:1,rf:2,rp:1,a:2`
[5/6]	bbbbb	7	`lf:7,rf:5,a:12`

Considering [length 4 / frequency 0] bbbc=d.

Step 3

Auxiliary generators:
1. c = aa
2. d = bbbc
Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(d) = 1; deg(c) = 2; deg(a) = 3

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