Morphocompletion for #2257 ⟨a, b | aabbaab=baa⟩

Solved by morph:2/0,3/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.	aabbaab ⇒ baa
2.	baabaab ⇒ aabbbaa
3.	bbaaaabb ⇒ aabbbbaa
4.	aabaabbbaa ⇒ baaaab
5.	aabbbaabbaa ⇒ bbaaaab
6.	aabbbbaaaab ⇒ bbaabaa
7.	baaaabbbaa ⇒ aabbbaaaab
8.	baabbbaaaab ⇒ aabbbbaabaa
9.	bbbaaaabaab ⇒ aabbbbbaaaa
10.	aaaabbbbaabaa ⇒ baaaabaab
11.	aabbbbaabbaaaab ⇒ bbbaaaa
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	aa	49	`lf:39,lp:6,ls:4,rf:31,rp:5,rs:7,lsrp:1,lprs:3`
[2/1]	ab	27	`lf:21,ls:6,rf:12,rs:4`
[2/2]	bb	27	`lf:24,lp:2,ls:1,rf:18,rp:3`
[2/3]	ba	22	`lf:19,lp:3,rf:14,rp:3`
[3/0]	aab	32	`lf:21,lp:5,ls:6,rf:12,rp:5,rs:4,lsrp:3,lprs:2`
[3/1]	baa	26	`lf:19,lp:3,ls:4,rf:14,rp:3,rs:5,re:1,lsrp:2,lprs:2`
[3/2]	aaa	15	`lf:14,lp:1,rf:12,rs:2,a:2`
[3/3]	bba	13	`lf:12,lp:1,rf:8,rp:2`
[4/0]	bbaa	16	`lf:12,lp:1,ls:3,rf:8,rp:2,rs:2,lsrp:1,lprs:1`
[4/1]	aabb	16	`lf:11,lp:4,ls:1,rf:5,rp:5,lsrp:1`
[4/2]	baab	14	`lf:9,lp:2,ls:3,rf:3,rs:1`
[4/3]	aaab	10	`lf:7,ls:3,rf:4,rs:3,a:2`
[5/0]	aaaab	11	`lf:7,lp:1,ls:3,rf:4,rs:3,a:2`
[5/1]	bbbaa	11	`lf:8,lp:1,ls:2,rf:6,rp:1,rs:2,a:1`
[5/2]	aabbb	10	`lf:7,lp:3,rf:5,rp:5,a:1`
[5/3]	baaaa	7	`lf:6,lp:1,rf:6,rp:2,rs:2,a:2`
[6/0]	baaaab	10	`lf:6,lp:1,ls:3,rf:4,rp:2,rs:3,re:1,lprs:1,a:2`
[6/1]	bbaaaa	6	`lf:5,lp:1,rf:4,rp:1,rs:2,a:3`
[6/2]	aabaab	6	`lf:3,lp:1,ls:2,rf:1,rs:1,a:1`
[6/3]	abbbaa	6	`lf:4,ls:2,rf:2,rs:1,a:1`

Considering [length 2 / frequency 0] 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: roundsLimit

#	Rule
1.	cbbcb ⇒ bc
2.	bcbcb ⇒ cbbbc
3.	bbccbb ⇒ cbbbbc
4.	cbcbbbc ⇒ bccb
5.	cbbbcbbc ⇒ bbccb
6.	cbbbbccb ⇒ bbcbc
7.	bccbbbc ⇒ cbbbccb
8.	bcbccbbb ⇒ ccbbbbbc
9.	bcbbbccb ⇒ cbbbbcbc
10.	bbbccbcb ⇒ cbbbbbcc
11.	ccbbbcbbbc ⇒ bccbcbb
12.	ccbbbbcbc ⇒ bccbcb
13.	ccbbbbcbbc ⇒ bcbccbb
14.	cbccbbbbbc ⇒ bcccbbb
15.	cbcbbbbcbc ⇒ bcbbccb
16.	cbcbbbbbcc ⇒ bbcbccb
17.	cbbbbcbbccb ⇒ bbbcc
18.	ca ⇒ ac
19.	bccba ⇒ cbcbbbac
20.	aa ⇒ c
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	cb	49	`lf:35,lp:8,ls:6,rf:24,rp:6,rs:6,lsrp:3,lprs:4,a:2`
[2/1]	bb	49	`lf:45,lp:2,ls:2,rf:30,rp:4,rs:3,a:2`
[2/2]	bc	46	`lf:33,lp:5,ls:8,rf:25,rp:7,rs:6,re:1,lsrp:6,lprs:3,a:2`
[2/3]	cc	17	`lf:13,lp:3,ls:1,rf:13,rp:1,rs:2,a:5`
[2/4]	ba	2	`lf:1,ls:1,rf:1,a:9`
[2/5]	ac	0	`rf:2,rp:1,rs:2,re:1,a:3`
[3/0]	bbc	26	`lf:19,lp:1,ls:6,rf:11,rp:3,rs:3,lsrp:1,lprs:1,a:2`
[3/1]	bbb	26	`lf:24,lp:1,ls:1,rf:15,rp:1,rs:1,a:4`
[3/2]	cbb	24	`lf:19,lp:4,ls:1,rf:11,rp:5,rs:2,lsrp:1,a:2`
[3/3]	bcb	21	`lf:15,lp:3,ls:3,rf:8,rp:2,rs:1,a:2`
[3/4]	ccb	18	`lf:12,lp:3,ls:3,rf:10,rp:1,rs:5,a:5`
[3/5]	cbc	15	`lf:9,lp:4,ls:2,rf:7,rp:1,rs:2,a:4`
[3/6]	bcc	13	`lf:10,lp:2,ls:1,rf:11,rp:4,rs:2,a:5`
[4/0]	bbbc	19	`lf:14,lp:1,ls:4,rf:7,rp:1,rs:3,a:4`
[4/1]	cbbb	18	`lf:14,lp:3,ls:1,rf:8,rp:5,rs:1,a:4`
[4/2]	bccb	14	`lf:9,lp:2,ls:3,rf:8,rp:3,rs:5,re:1,lprs:1,a:5`
[4/3]	ccbb	11	`lf:7,lp:3,ls:1,rf:3,rp:1,rs:1,lprs:1,a:6`
[4/4]	cbcb	10	`lf:5,lp:3,ls:2,rf:3,rp:1,rs:1,a:4`
[4/5]	bcbb	9	`lf:8,lp:1,rf:3,rp:1,rs:1,a:5`
[4/6]	bbbb	9	`lf:9,rf:6,a:10`
[5/0]	cbbbc	10	`lf:6,lp:1,ls:3,rf:2,rp:2,rs:1,re:1,lsrp:1,a:4`
[5/1]	ccbbb	10	`lf:6,lp:3,ls:1,rf:2,rp:1,rs:1,lsrp:1,a:6`
[5/2]	bbccb	9	`lf:5,lp:1,ls:3,rf:3,rp:1,rs:3,re:1,a:6`
[5/3]	cbbbb	9	`lf:7,lp:2,rf:4,rp:3,a:10`
[5/4]	bbbbc	8	`lf:7,ls:1,rf:4,rs:2,a:10`
[5/5]	bbbcc	6	`lf:4,lp:1,ls:1,rf:3,rp:1,rs:2,re:1,lprs:1,a:6`
[5/6]	bccbb	6	`lf:4,lp:1,ls:1,rf:1,rs:1,a:6`

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

Step 3

Auxiliary generators:
1. c = aa
2. d = bbc
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 | aabbaab=baa⟩.