Morphocompletion for #4631 ⟨a, b | aabaabba=baa⟩

Solved by morph:2/1,5/1. (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: rulesLimit

#	Rule
1.	aabaabba ⇒ baa
2.	aabaabbbaa ⇒ babaa
3.	aabaabbbbaa ⇒ babbaa
4.	aabaabbbabaa ⇒ bababaa
5.	aabaabbbbbaa ⇒ babbbaa
6.	aabaabbbabbaa ⇒ bababbaa
7.	aabaabbbbabaa ⇒ babbabaa
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	aa	33	`lf:20,lp:7,ls:6,rf:7,rs:7,lprs:7,lsrs:6`
[2/1]	bb	18	`lf:18,rf:5`
[2/2]	ba	18	`lf:17,ls:1,rf:16,rp:7,lsrp:1`
[2/3]	ab	17	`lf:17,rf:9`
[3/0]	aab	21	`lf:14,lp:7`
[3/1]	baa	19	`lf:13,ls:6,rf:7,rp:1,rs:7,re:1,lsrs:6`
[3/2]	bbb	10	`lf:10,rf:1,a:1`
[3/3]	bba	9	`lf:8,ls:1,rf:4`
[4/0]	aaba	14	`lf:7,lp:7`
[4/1]	abaa	11	`lf:9,ls:2,rf:3,rs:3,lsrs:2`
[4/2]	bbaa	8	`lf:4,ls:4,rf:3,rs:3,lsrs:3,a:1`
[4/3]	baab	7	`lf:7`
[5/0]	aabaa	14	`lf:7,lp:7`
[5/1]	baabb	7	`lf:7`
[5/2]	abaab	7	`lf:7`
[5/3]	bbbaa	6	`lf:3,ls:3,rf:1,rs:1,lsrs:1,a:1`
[6/0]	aabaab	14	`lf:7,lp:7`
[6/1]	abaabb	7	`lf:7`
[6/2]	baabbb	6	`lf:6,a:1`
[6/3]	bbbbaa	4	`lf:2,ls:2,a:3`

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

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: pendingRulesLimit

#	Rule
1.	bc ⇒ cb
2.	aabaaca ⇒ baa
3.	aabaaccaa ⇒ bacaa
4.	aabaacccaa ⇒ baccaa
5.	aabaaccacaa ⇒ bacacaa
6.	bb ⇒ c
7.	aabaacbaa ⇒ babaa
8.	aabaaccbaa ⇒ bacbaa
9.	aabaaccabaa ⇒ bacabaa
10.	aabaacccbaa ⇒ baccbaa
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	aa	38	`lf:23,lp:8,ls:7,rf:8,rs:8,lprs:8,lsrs:7,a:2`
[2/1]	ba	12	`lf:12,rf:12,rp:8,a:2`
[2/2]	ab	9	`lf:9,rf:2,a:2`
[2/3]	ac	9	`lf:9,rf:7,a:2`
[2/4]	cc	8	`lf:8,rf:2,a:6`
[2/5]	ca	7	`lf:6,ls:1,rf:5,a:2`
[2/6]	cb	3	`lf:3,rf:3,rp:1,rs:1,re:1,a:3`
[3/0]	baa	16	`lf:12,ls:4,rf:5,rp:1,rs:5,re:1,lsrs:4,a:2`
[3/1]	aab	16	`lf:8,lp:8,a:2`
[3/2]	aba	9	`lf:9,rf:2,a:2`
[3/3]	aac	8	`lf:8,a:2`
[3/4]	acc	6	`lf:6,rf:2,a:6`
[3/5]	caa	6	`lf:3,ls:3,rf:3,rs:3,lsrs:3,a:6`
[3/6]	cca	4	`lf:4,rf:1,a:6`
[4/0]	aaba	16	`lf:8,lp:8,a:2`
[4/1]	abaa	10	`lf:9,ls:1,rf:2,rs:2,lsrs:1,a:2`
[4/2]	baac	8	`lf:8,a:2`
[4/3]	cbaa	6	`lf:3,ls:3,rf:2,rs:2,lsrs:2,a:4`
[4/4]	aacc	6	`lf:6,a:6`
[4/5]	ccaa	4	`lf:2,ls:2,rf:1,rs:1,lsrs:1,a:6`
[4/6]	acca	3	`lf:3,rf:1,a:6`
[5/0]	aabaa	16	`lf:8,lp:8,a:2`
[5/1]	abaac	8	`lf:8,a:2`
[5/2]	baacc	6	`lf:6,a:6`
[5/3]	ccbaa	4	`lf:2,ls:2,rf:1,rs:1,lsrs:1,a:12`
[5/4]	aacca	3	`lf:3,a:6`
[5/5]	baaca	2	`lf:1,ls:1,a:2`
[5/6]	cabaa	2	`lf:1,ls:1,rf:1,rs:1,lsrs:1,a:7`

Considering [length 5 / frequency 1] abaac=d.

Step 3

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

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