Morphocompletion for #861 ⟨a, b | abbabaab=a⟩

Solved by morph:6/1,4/0. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

Collecting factors up to length 7 / frequency 4:

Considering [length 6 / frequency 1] ababaa=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	a ⇒ cbb
2.	ccbbcbbb ⇒ cbbcbbbc
3.	ccbbbcbbcb ⇒ cbcbbbcbbc
4.	cbcbbbcbbcb ⇒ cbbcbbbcbbc
5.	cbbcbbbcbbcb ⇒ cbbbcbbbcbbc
6.	cbbbcbbbcbbcb ⇒ cbbbbcbbbcbbc
7.	cbbbbcbbbcbbcb ⇒ c
8.	ccbbbcbbcbb ⇒ cbbcbbbcbbc
9.	cbcbbbcbbcbb ⇒ cbbbcbbbcbbc
10.	ccbbcbbbcbbc ⇒ cbbcbbbccbbc
11.	cbbcbbbccbbcb ⇒ ccbbbcbbbcbbc
12.	cbbcbbbcbbbcbbbcbbc ⇒ ccbbcb
13.	cbbbcbbbcbbbcbbbcbbc ⇒ cbcbbcb
14.	cbbcbbbcbbbbcbbbcbbc ⇒ ccbbcbb
15.	cbbbcbbbcbbccbbcb ⇒ ccbbbcbbbcbbbcbbc
16.	cbbcbbbccbbbcbbbcbbc ⇒ cccbbcb
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	bb	83	`lf:80,ls:3,rf:52,rs:2,a:2`
[2/1]	cb	78	`lf:60,lp:11,ls:7,rf:40,rp:10,rs:3,lprp:5,lsrp:4,lprs:3,a:2`
[2/2]	bc	55	`lf:50,ls:5,rf:35,rs:10,lsrs:1,a:2`
[2/3]	cc	11	`lf:7,lp:4,rf:7,rp:5,a:7`
[3/0]	cbb	62	`lf:51,lp:9,ls:2,rf:35,rp:8,rs:2,re:1,lprp:2,lsrp:2,lprs:1,a:2`
[3/1]	bbc	53	`lf:48,ls:5,rf:33,rs:10,lsrs:1,a:2`
[3/2]	bcb	49	`lf:42,ls:7,rf:24,rs:3,a:2`
[3/3]	bbb	30	`lf:29,ls:1,rf:17,a:2`
[3/4]	ccb	11	`lf:7,lp:4,rf:6,rp:4,a:7`
[3/5]	cbc	4	`lf:2,lp:2,rf:2,rp:2,a:2`
[3/6]	bcc	3	`lf:3,rf:1,a:14`
[4/0]	bbcb	47	`lf:40,ls:7,rf:22,rs:3,a:2`
[4/1]	bcbb	37	`lf:35,ls:2,rf:21,rs:1,a:2`
[4/2]	cbbc	32	`lf:22,lp:5,ls:5,rf:17,rp:4,rs:9,lsrp:1,lprs:2,lsrs:1,a:2`
[4/3]	cbbb	32	`lf:27,lp:4,ls:1,rf:16,rp:3,lprp:1,a:2`
[4/4]	bbbc	26	`lf:26,rf:16,rs:1,a:2`
[4/5]	ccbb	11	`lf:7,lp:4,rf:6,rp:4,a:7`
[4/6]	cbcb	4	`lf:2,lp:2,rf:2,rp:2,a:2`
[5/0]	bbcbb	35	`lf:33,ls:2,rf:19,rs:1,a:2`
[5/1]	cbbcb	28	`lf:16,lp:5,ls:7,rf:8,rp:4,rs:3,lsrp:1,lprs:2,a:2`
[5/2]	cbbbc	27	`lf:24,lp:3,rf:15,rp:2,rs:1,a:2`
[5/3]	bbbcb	24	`lf:24,rf:14,a:2`
[5/4]	bcbbb	21	`lf:20,ls:1,rf:11,a:2`
[5/5]	bcbbc	18	`lf:13,ls:5,rf:9,rs:8,a:2`
[5/6]	ccbbc	6	`lf:4,lp:2,rf:4,rp:2,rs:1,lprs:1,a:14`

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

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

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