Morphocompletion for #4647 ⟨a, b | aabababa=baa⟩

Solved by morph:5/1,3/0. (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.	aabababa ⇒ baa
2.	aabababbaa ⇒ babaa
3.	aabababbbaa ⇒ babbaa
4.	aabababbabaa ⇒ bababaa
5.	aabababbbbaa ⇒ babbbaa
6.	aabababbabbaa ⇒ bababbaa
7.	aabababbbabaa ⇒ babbabaa
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	aa	26	`lf:13,lp:7,ls:6,rf:7,rs:7,lprs:7,lsrs:6`
[2/1]	ba	25	`lf:24,ls:1,rf:16,rp:7,lsrp:1`
[2/2]	ab	24	`lf:24,rf:9`
[2/3]	bb	11	`lf:11,rf:5,a:1`
[3/0]	aba	18	`lf:17,ls:1,rf:5`
[3/1]	bab	17	`lf:17,rf:9,rp:6`
[3/2]	aab	14	`lf:7,lp:7`
[3/3]	baa	12	`lf:6,ls:6,rf:7,rp:1,rs:7,re:1,lsrs:6`
[4/0]	abab	14	`lf:14,rf:2`
[4/1]	aaba	14	`lf:7,lp:7`
[4/2]	baba	11	`lf:10,ls:1,rf:5,rp:3`
[4/3]	bbaa	8	`lf:4,ls:4,rf:3,rs:3,lsrs:3,a:1`
[5/0]	aabab	14	`lf:7,lp:7`
[5/1]	ababa	9	`lf:8,ls:1,rf:1`
[5/2]	babab	7	`lf:7,rf:2,rp:2`
[5/3]	ababb	6	`lf:6,rf:1,a:1`
[6/0]	aababa	14	`lf:7,lp:7`
[6/1]	ababab	7	`lf:7`
[6/2]	bababb	6	`lf:6,rf:1,rp:1,a:1`
[6/3]	bbabaa	4	`lf:2,ls:2,rf:1,rs:1,lsrs:1,a:2`

Considering [length 5 / frequency 1] ababa=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	baa ⇒ acba
2.	abc ⇒ cba
3.	bac ⇒ acbc
4.	ababa ⇒ c
5.	aacacbcba ⇒ ca
6.	aacacbcacba ⇒ caa
7.	aacacbcacacba ⇒ caaa
8.	aacacbcbc ⇒ cc
9.	aacacbcacbc ⇒ cac
10.	aacacbcacacbc ⇒ caac
11.	acbbca ⇒ bcacba
12.	acbbcc ⇒ bcacbc
13.	acacbcacbcba ⇒ bca
14.	acacbcacbcacba ⇒ bcaa
15.	acacbcacbcbc ⇒ bcc
16.	acacbcacbcacbc ⇒ bcac
17.	acbcbbca ⇒ bbcacba
18.	acbbcbca ⇒ bcbcacba
19.	acbcbbcc ⇒ bbcacbc
20.	acbcacbcacbcba ⇒ bbca
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ac	52	`lf:41,lp:10,ls:1,rf:10,rp:2,rs:3,lsrp:1,lprs:1,a:2`
[2/1]	bc	37	`lf:31,ls:6,rf:14,rp:7,rs:3,lsrp:2,a:3`
[2/2]	cb	36	`lf:36,rf:9,rp:1,a:2`
[2/3]	ca	30	`lf:27,ls:3,rf:14,rp:5,rs:3,re:1,a:4`
[2/4]	ba	19	`lf:10,lp:2,ls:7,rf:5,rs:5,lprs:1,a:1`
[2/5]	aa	14	`lf:7,lp:6,ls:1,rf:5,rs:3,lprs:2,a:2`
[2/6]	bb	5	`lf:5,rf:3,rp:3,a:15`
[3/0]	acb	34	`lf:28,lp:6,rf:7,rp:2,a:2`
[3/1]	cbc	30	`lf:25,ls:5,rf:4,rs:3,a:4`
[3/2]	cac	24	`lf:24,rf:7,rp:1,rs:2,re:1,a:4`
[3/3]	bca	18	`lf:15,ls:3,rf:9,rp:5,rs:2,re:1,lsrp:1,a:7`
[3/4]	aca	16	`lf:12,lp:4,a:4`
[3/5]	cba	12	`lf:6,ls:6,rf:5,rp:1,rs:5,re:1,a:2`
[3/6]	aac	12	`lf:6,lp:6,rf:1,rs:1,lprs:1,a:4`
[4/0]	acbc	28	`lf:22,lp:3,ls:3,rf:3,rp:1,rs:3,re:1,lprs:1,a:4`
[4/1]	cacb	22	`lf:22,rf:5,a:4`
[4/2]	acac	16	`lf:12,lp:4,a:4`
[4/3]	cbca	14	`lf:13,ls:1,rf:1,a:7`
[4/4]	bcac	12	`lf:12,rf:6,rp:3,rs:1,re:1,a:7`
[4/5]	aaca	12	`lf:6,lp:6,a:4`
[4/6]	cbcb	7	`lf:7,a:4`
[5/0]	cacbc	22	`lf:19,ls:3,rf:2,rs:2,a:4`
[5/1]	acacb	16	`lf:12,lp:4,a:4`
[5/2]	acbca	13	`lf:12,lp:1,a:7`
[5/3]	cbcac	12	`lf:12,rf:1,a:7`
[5/4]	aacac	12	`lf:6,lp:6,a:4`
[5/5]	bcacb	10	`lf:10,rf:5,rp:2,a:7`
[5/6]	acbcb	9	`lf:7,lp:2,a:4`

Considering [length 3 / frequency 0] acb=d.

Step 3

Auxiliary generators:
1. c = ababa
2. d = acb
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 | aabababa=baa⟩.