Morphocompletion for #4278 ⟨a, b, c | aab=1, bcca=c⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	aac ⇒ cca
2.	bcca ⇒ c
3.	bcccca ⇒ cac
4.	bcccccca ⇒ cacac
5.	bcccccccca ⇒ cacacac
6.	bcccccccccca ⇒ cacacacac
7.	cba ⇒ bcc
8.	cab ⇒ bcc
9.	aab ⇒ 1
10.	bcbcc ⇒ cb
11.	bcccbcc ⇒ cacb
12.	bcccccbcc ⇒ cacacb
13.	bcccccccbcc ⇒ cacacacb
14.	cbba ⇒ bccb
15.	cbbba ⇒ bccbb
16.	cbbbba ⇒ bccbbb
17.	cbbbbba ⇒ bccbbbb
18.	cbbbbbba ⇒ bccbbbbb
19.	cbbbbbbba ⇒ bccbbbbbb
20.	cbbbbbbbba ⇒ bccbbbbbbb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	45	`lf:41,ls:4,rf:10,rp:1,rs:2,a:1`
[2/1]	bb	28	`lf:28,rf:21,rs:6,a:8`
[2/2]	bc	22	`lf:13,lp:9,rf:9,rp:9,a:1`
[2/3]	cb	20	`lf:12,lp:8,rf:11,rp:1,rs:5,re:1,lprs:1,a:5`
[2/4]	ba	16	`lf:8,ls:8,a:7`
[2/5]	ca	12	`lf:6,lp:1,ls:5,rf:17,rp:7,rs:1,lsrp:4,a:1`
[2/6]	ab	4	`lf:2,ls:2`
[3/0]	ccc	29	`lf:29,a:4`
[3/1]	bcc	24	`lf:12,lp:8,ls:4,rf:9,rp:9,rs:2,re:2,a:1`
[3/2]	bbb	21	`lf:21,rf:15,rs:5,a:9`
[3/3]	cbb	14	`lf:7,lp:7,rf:6,rs:1,lprs:1,a:8`
[3/4]	bba	14	`lf:7,ls:7,a:8`
[3/5]	cca	10	`lf:5,ls:5,rf:1,rp:1,rs:1,re:1,a:1`
[3/6]	cbc	4	`lf:4,a:5`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | aab=1, bcca=c⟩.