Morphocompletion for #6267 ⟨a, b, c | aa=1, bcbbbc=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	aa ⇒ 1
2.	cbb ⇒ bbc
3.	cbcb ⇒ bcbc
4.	cbccb ⇒ bccbc
5.	bbbcbc ⇒ 1
6.	cbcccb ⇒ bcccbc
7.	bcbccb ⇒ bbccbc
8.	bcbcccb ⇒ bbcccbc
9.	bbbbccbc ⇒ cb
10.	bcbccccb ⇒ bbccccbc
11.	bbbbcccbc ⇒ ccb
12.	bbbbbccbc ⇒ bcb
13.	bbbbccccbc ⇒ cccb
14.	bbbbcccccbc ⇒ ccccb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bc	30	`lf:21,lp:3,ls:6,rf:14,rp:4,rs:7,lsrp:1,lprs:3,a:3`
[2/1]	cb	29	`lf:19,lp:4,ls:6,rf:11,rp:1,rs:5,re:1,a:3`
[2/2]	bb	26	`lf:19,lp:6,ls:1,rf:4,rp:4,lsrp:10,a:3`
[2/3]	cc	20	`lf:20,rf:15,rp:3,a:5`
[3/0]	cbc	21	`lf:12,lp:3,ls:6,rf:6,rs:6,lprs:12,a:3`
[3/1]	bbb	18	`lf:12,lp:6,a:3`
[3/2]	ccb	15	`lf:10,ls:5,rf:8,rp:1,rs:3,re:1,a:5`
[3/3]	bcc	10	`lf:10,rf:5,rp:2,a:5`
[3/4]	ccc	10	`lf:10,rf:7,rp:2,a:18`
[3/5]	bcb	9	`lf:5,lp:3,ls:1,rf:2,rp:2,rs:1,re:1,lsrp:10,a:3`
[3/6]	bbc	6	`lf:6,rf:4,rp:4,rs:1,re:1,a:3`

Considering [length 2 / frequency 0] bc=d.

Step 2

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

Rewriting system is complete. See ⟨a, b, c | aa=1, bcbbbc=1⟩.