Morphocompletion for #3534 ⟨a, b, c | bb=ac, bca=b⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right recursive path with deg(a) = 0; deg(b) = 1; deg(c) = 2

Rewriting system is not complete: roundsLimit

#	Rule
1.	ac ⇒ bb
2.	bca ⇒ b
3.	bcbb ⇒ bc
4.	bcca ⇒ bc
5.	bccbb ⇒ bcc
6.	bccca ⇒ bcc
7.	bcccbb ⇒ bccc
8.	bcccca ⇒ bccc
9.	bccccbb ⇒ bcccc
10.	bccccca ⇒ bcccc
11.	bcccccbb ⇒ bccccc
12.	bcccccca ⇒ bccccc
13.	bccccccbb ⇒ bcccccc
14.	bccccccca ⇒ bcccccc
15.	bcccccccbb ⇒ bccccccc
16.	bcccccccca ⇒ bccccccc
17.	bccccccccbb ⇒ bcccccccc
18.	bccccccccca ⇒ bcccccccc
19.	bcccccccccbb ⇒ bccccccccc
20.	bcccccccccca ⇒ bccccccccc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	81	`lf:81,rf:72,rs:16,a:3`
[2/1]	bc	38	`lf:19,lp:19,rf:18,rp:18,rs:2,re:2,lprp:18,lprs:2,a:1`
[2/2]	ca	20	`lf:10,ls:10,a:1`
[2/3]	bb	18	`lf:9,ls:9,rf:1,rp:1,rs:1,re:1`
[2/4]	cb	9	`lf:9,a:2`
[3/0]	ccc	64	`lf:64,rf:56,rs:14,a:5`
[3/1]	bcc	34	`lf:17,lp:17,rf:16,rp:16,rs:2,re:2,lprp:16,lprs:2,a:3`
[3/2]	cca	18	`lf:9,ls:9,a:3`
[3/3]	cbb	18	`lf:9,ls:9,a:2`
[3/4]	ccb	8	`lf:8,a:4`
[3/5]	bcb	2	`lf:1,lp:1,a:2`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | bb=ac, bca=b⟩.