Morphocompletion for #5747 ⟨a, b, c | aa=b, bcb=bc⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right shortlex with a < b < c

Rewriting system is not complete: pendingRulesLimit

#	Rule
1.	aa ⇒ b
2.	ba ⇒ ab
3.	bcb ⇒ bc
4.	bcab ⇒ bca
5.	bccb ⇒ bcc
6.	bcacb ⇒ bcac
7.	bccab ⇒ bcca
8.	bcccb ⇒ bccc
9.	bcacab ⇒ bcaca
10.	bcaccb ⇒ bcacc
11.	bccacb ⇒ bccac
12.	bcccab ⇒ bccca
13.	bccccb ⇒ bcccc
14.	bcacacb ⇒ bcacac
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bc	24	`lf:12,lp:12,rf:12,rp:12,rs:1,re:1,lprp:12,lprs:1,a:1`
[2/1]	cb	16	`lf:8,ls:8,a:1`
[2/2]	cc	11	`lf:11,rf:11,rs:4,a:3`
[2/3]	ca	10	`lf:10,rf:10,rs:4,a:4`
[2/4]	ab	8	`lf:4,ls:4,rf:1,rp:1,rs:1,re:1,a:2`
[2/5]	ac	6	`lf:6,rf:6,rs:3,a:6`
[3/0]	bcc	12	`lf:6,lp:6,rf:6,rp:6,rs:1,re:1,lprp:6,lprs:1,a:3`
[3/1]	bca	10	`lf:5,lp:5,rf:5,rp:5,rs:1,re:1,lprp:5,lprs:1,a:4`
[3/2]	ccb	8	`lf:4,ls:4,a:3`
[3/3]	cab	8	`lf:4,ls:4,a:4`
[3/4]	cac	6	`lf:6,rf:6,rs:3,a:6`
[3/5]	acb	6	`lf:3,ls:3,a:6`
[3/6]	ccc	4	`lf:4,rf:4,rs:2,a:8`

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

Step 2

Auxiliary generators:
1. d = bc
Reduction order:
- Left-to-right shortlex with a < b < d < c

Rewriting system is complete. See ⟨a, b, c | aa=b, bcb=bc⟩.