Morphocompletion for #4779 ⟨a, b | abaaabba=baa⟩

Solved by morph:4/1,4/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.	abaaabba ⇒ baa
2.	abaaabbbaa ⇒ babaa
3.	abaaabbbbaa ⇒ babbaa
4.	abaaabbbabaa ⇒ bababaa
5.	abaaabbbbbaa ⇒ babbbaa
6.	abaaabbbbabaa ⇒ babbabaa
7.	abaaabbbabbaa ⇒ bababbaa
8.	abaaabbbababaa ⇒ babababaa
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	aa	30	`lf:23,ls:7,rf:8,rs:8,lsrs:7`
[2/1]	ab	29	`lf:21,lp:8,rf:12`
[2/2]	ba	22	`lf:21,ls:1,rf:20,rp:8,lsrp:1`
[2/3]	bb	20	`lf:20,rf:5`
[3/0]	baa	22	`lf:15,ls:7,rf:8,rp:1,rs:8,re:1,lsrs:7`
[3/1]	aba	20	`lf:12,lp:8,rf:8`
[3/2]	bbb	11	`lf:11,rf:1,a:1`
[3/3]	bba	10	`lf:9,ls:1,rf:4`
[4/0]	abaa	22	`lf:11,lp:8,ls:3,rf:4,rs:4,lprs:4,lsrs:3`
[4/1]	aabb	8	`lf:8`
[4/2]	bbaa	8	`lf:4,ls:4,rf:3,rs:3,lsrs:3,a:1`
[4/3]	aaab	8	`lf:8`
[5/0]	abaaa	16	`lf:8,lp:8`
[5/1]	aaabb	8	`lf:8`
[5/2]	baaab	8	`lf:8`
[5/3]	aabbb	7	`lf:7,a:1`
[6/0]	abaaab	16	`lf:8,lp:8`
[6/1]	baaabb	8	`lf:8`
[6/2]	aaabbb	7	`lf:7,a:1`
[6/3]	bbbbaa	4	`lf:2,ls:2,a:5`

Considering [length 4 / frequency 1] aabb=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: pendingRulesLimit

#	Rule
1.	abaca ⇒ baa
2.	aabb ⇒ c
3.	abacc ⇒ bac
4.	abacbaa ⇒ babaa
5.	abacbc ⇒ babc
6.	abacbac ⇒ babac
7.	abacbbaa ⇒ babbaa
8.	abacbabaa ⇒ bababaa
9.	abacbbc ⇒ babbc
10.	abacbbac ⇒ babbac
11.	abacbabc ⇒ bababc
12.	abacbabac ⇒ bababac
13.	abacbbabaa ⇒ babbabaa
14.	abacbabbaa ⇒ bababbaa
15.	abacbbabc ⇒ babbabc
16.	abacbbabac ⇒ babbabac
17.	abacbabbc ⇒ bababbc
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ab	41	`lf:25,lp:16,rf:22,a:1`
[2/1]	ba	33	`lf:33,rf:33,rp:16,a:2`
[2/2]	ac	24	`lf:20,ls:4,rf:5,rs:5,lsrs:4,a:2`
[2/3]	cb	14	`lf:14,a:4`
[2/4]	aa	12	`lf:6,lp:1,ls:5,rf:6,rs:6,lsrs:5,a:1`
[2/5]	bb	10	`lf:9,ls:1,rf:8,a:1`
[2/6]	bc	10	`lf:5,ls:5,rf:5,rs:5,lsrs:5,a:7`
[3/0]	aba	36	`lf:20,lp:16,rf:11,a:2`
[3/1]	bac	24	`lf:20,ls:4,rf:5,rp:1,rs:5,re:1,lsrs:4,a:2`
[3/2]	acb	14	`lf:14,a:4`
[3/3]	baa	10	`lf:5,ls:5,rf:6,rp:1,rs:6,re:1,lsrs:5,a:2`
[3/4]	bab	8	`lf:8,rf:22,rp:14,a:4`
[3/5]	cba	7	`lf:7,a:4`
[3/6]	cbb	6	`lf:6,a:19`
[4/0]	abac	36	`lf:18,lp:16,ls:2,rf:3,rs:3,lprs:3,lsrs:2,a:2`
[4/1]	bacb	14	`lf:14,a:4`
[4/2]	acba	7	`lf:7,a:4`
[4/3]	acbb	6	`lf:6,a:19`
[4/4]	cbab	5	`lf:5,a:6`
[4/5]	cbba	5	`lf:5,a:19`
[4/6]	babc	4	`lf:2,ls:2,rf:3,rp:1,rs:3,re:1,lsrs:2,a:7`
[5/0]	abacb	28	`lf:14,lp:14,a:4`
[5/1]	bacba	7	`lf:7,a:4`
[5/2]	bacbb	6	`lf:6,a:19`
[5/3]	acbab	5	`lf:5,a:6`
[5/4]	acbba	5	`lf:5,a:19`
[5/5]	babac	4	`lf:2,ls:2,rf:3,rp:1,rs:3,re:1,lsrs:2,a:5`
[5/6]	babaa	4	`lf:2,ls:2,rf:3,rp:1,rs:3,re:1,lsrs:2,a:4`

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

Step 3

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

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