Morphocompletion for #1073 ⟨a, b | aababa=baa⟩

Solved by morph:3/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.	aababa ⇒ baa
2.	aababbaa ⇒ babaa
3.	aababbbaa ⇒ babbaa
4.	aababbabaa ⇒ bababaa
5.	aababbbbaa ⇒ babbbaa
6.	aababbabbaa ⇒ bababbaa
7.	aababbbabaa ⇒ 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	18	`lf:17,ls:1,rf:16,rp:7,lsrp:1`
[2/2]	ab	17	`lf:17,rf:9`
[2/3]	bb	11	`lf:11,rf:5,a:1`
[3/0]	aab	14	`lf:7,lp:7`
[3/1]	baa	12	`lf:6,ls:6,rf:7,rp:1,rs:7,re:1,lsrs:6`
[3/2]	aba	11	`lf:10,ls:1,rf:5`
[3/3]	bab	10	`lf:10,rf:9,rp:6`
[4/0]	aaba	14	`lf:7,lp:7`
[4/1]	bbaa	8	`lf:4,ls:4,rf:3,rs:3,lsrs:3,a:1`
[4/2]	babb	7	`lf:7,rf:4,rp:3,a:1`
[4/3]	abab	7	`lf:7,rf:2`
[5/0]	aabab	14	`lf:7,lp:7`
[5/1]	ababb	6	`lf:6,rf:1,a:1`
[5/2]	bbbaa	4	`lf:2,ls:2,rf:1,rs:1,lsrs:1,a:3`
[5/3]	babba	4	`lf:4,rf:3,rp:2,a:1`
[6/0]	aababb	12	`lf:6,lp:6,a:1`
[6/1]	bbabaa	4	`lf:2,ls:2,rf:1,rs:1,lsrs:1,a:2`
[6/2]	babbaa	4	`lf:2,ls:2,rf:2,rp:1,rs:2,re:1,lsrs:1,a:1`
[6/3]	ababbb	3	`lf:3,a:3`

Considering [length 3 / frequency 1] baa=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	baa ⇒ c
2.	cbac ⇒ bca
3.	aabac ⇒ ca
4.	aacabac ⇒ caa
5.	bcaa ⇒ ccabac
6.	baca ⇒ cabac
7.	cbaba ⇒ bc
8.	aababa ⇒ c
9.	cababa ⇒ bac
10.	aababc ⇒ bac
11.	ccababc ⇒ bcc
12.	aacababc ⇒ cc
13.	cacababc ⇒ bacc
14.	bbac ⇒ cbabc
15.	babac ⇒ cababc
16.	bcabac ⇒ cbabca
17.	aababbc ⇒ babc
18.	ccababbc ⇒ bcbc
19.	aacababbc ⇒ cbc
20.	bbabc ⇒ cbabbc
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ba	29	`lf:23,lp:3,ls:3,rf:10,rp:4,lsrp:1`
[2/1]	ab	24	`lf:24,rf:8`
[2/2]	bc	20	`lf:10,lp:2,ls:8,rf:11,rp:4,rs:7,re:1,lsrp:2,lsrs:4,a:3`
[2/3]	aa	18	`lf:9,lp:7,ls:2,rf:1,rs:1,lprs:1`
[2/4]	ac	17	`lf:11,ls:6,rf:5,rs:4,a:2`
[2/5]	ca	14	`lf:11,lp:2,ls:1,rf:7,rp:4,rs:3,re:1,lsrp:1,a:2`
[2/6]	bb	7	`lf:5,lp:2,rf:1,a:10`
[3/0]	aba	19	`lf:16,ls:3,rf:3`
[3/1]	bac	14	`lf:7,lp:1,ls:6,rf:5,rp:3,rs:4,re:2,lprs:1,a:2`
[3/2]	bab	13	`lf:12,lp:1,rf:5,rp:1`
[3/3]	abc	10	`lf:5,ls:5,rf:4,rs:3,a:8`
[3/4]	cab	9	`lf:8,lp:1,rf:3,rp:2,a:4`
[3/5]	aab	8	`lf:4,lp:4`
[3/6]	bbc	6	`lf:3,ls:3,rf:1,rs:1,a:17`
[4/0]	babc	10	`lf:5,ls:5,rf:4,rp:1,rs:3,re:1,a:8`
[4/1]	abab	9	`lf:9,rf:1`
[4/2]	caba	9	`lf:8,lp:1,rf:3,rp:2,a:4`
[4/3]	baba	8	`lf:4,lp:1,ls:3`
[4/4]	abac	8	`lf:4,ls:4,rf:2,rs:2,a:2`
[4/5]	aaba	8	`lf:4,lp:4`
[4/6]	abbc	6	`lf:3,ls:3,rf:1,rs:1,a:17`
[5/0]	ababc	8	`lf:4,ls:4,rf:1,rs:1,a:9`
[5/1]	cabab	7	`lf:6,lp:1,rf:1,rp:1,a:4`
[5/2]	babbc	6	`lf:3,ls:3,rf:1,rs:1,a:17`
[5/3]	aabab	6	`lf:3,lp:3`
[5/4]	aacab	6	`lf:3,lp:3,a:11`
[5/5]	ababa	4	`lf:2,ls:2`
[5/6]	cabac	4	`lf:2,ls:2,rf:2,rp:1,rs:2,re:1,a:6`

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

Step 3

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

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