Morphocompletion for #4873 ⟨a, b, c | ab=a, bbccb=1⟩

Solved by morph:3/0. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ a
2.	cbbb ⇒ bbbc
3.	acbbb ⇒ ac
4.	acc ⇒ a
5.	bbbcc ⇒ 1
6.	ccb ⇒ bcc
7.	acbcc ⇒ acb
8.	bbbcbcc ⇒ cb
9.	acbbcc ⇒ acbb
10.	bbbcbbcc ⇒ cbb
11.	acbcbcc ⇒ acbcb
12.	bbbcbcbcc ⇒ cbcb
13.	acbbcbcc ⇒ acbbcb
14.	bbbcbbcbcc ⇒ cbbcb
15.	acbcbbcc ⇒ acbcbb
16.	bbbcbcbbcc ⇒ cbcbb
17.	acbbcbbcc ⇒ acbbcbb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bb	32	`lf:24,lp:6,ls:2,rf:10,rp:1,rs:5,lsrp:1,lprs:2,a:7`
[2/1]	cc	28	`lf:14,lp:1,ls:13,rf:1,rs:1,lprs:10,a:4`
[2/2]	bc	24	`lf:24,rf:9,rp:1,rs:1,a:5`
[2/3]	cb	23	`lf:21,lp:1,ls:1,rf:18,rp:5,rs:6,re:1,a:5`
[2/4]	ac	16	`lf:8,lp:8,rf:7,rp:7,rs:1,re:1,lprp:7,lprs:1,a:4`
[3/0]	bcc	24	`lf:12,ls:12,rf:1,rp:1,rs:1,re:1,a:5`
[3/1]	bbb	16	`lf:8,lp:6,ls:2,rf:1,rp:1,lsrp:10,a:9`
[3/2]	acb	14	`lf:7,lp:7,rf:6,rp:6,rs:1,re:1,lprp:6,lprs:1,a:6`
[3/3]	bbc	14	`lf:14,rf:4,rs:1,a:7`
[3/4]	bcb	12	`lf:12,rf:7,rs:4,a:8`
[3/5]	cbb	11	`lf:10,lp:1,rf:8,rp:2,rs:5,re:1,a:7`
[3/6]	cbc	10	`lf:10,rf:4,rp:2,a:6`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | ab=a, bbccb=1⟩.