Morphocompletion for #2384 ⟨a, b, c | aab=a, bccb=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	aab ⇒ a
2.	acc ⇒ aaa
3.	abcc ⇒ aa
4.	cbb ⇒ bbc
5.	aaacbb ⇒ ac
6.	ccb ⇒ bcc
7.	bbcc ⇒ 1
8.	acbcc ⇒ aaacb
9.	abcbcc ⇒ aacb
10.	bbcbcc ⇒ cb
11.	acbcbcc ⇒ aaacbcb
12.	abcbcbcc ⇒ aacbcb
13.	bbcbcbcc ⇒ cbcb
14.	acbcbcbcc ⇒ aaacbcbcb
15.	abcbcbcbcc ⇒ aacbcbcb
16.	bbcbcbcbcc ⇒ cbcbcb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	26	`lf:13,lp:1,ls:12,rf:1,rs:1,lprs:10,a:2`
[2/1]	bc	26	`lf:26,rf:11,rp:1,rs:1,a:2`
[2/2]	cb	23	`lf:21,lp:1,ls:1,rf:18,rp:3,rs:9,re:1,a:3`
[2/3]	bb	12	`lf:6,lp:4,ls:2,rf:1,rp:1,lsrp:10,a:12`
[2/4]	ab	10	`lf:5,lp:4,ls:1`
[2/5]	ac	9	`lf:5,lp:4,rf:7,rp:1,rs:1,re:1,a:4`
[2/6]	aa	5	`lf:3,lp:2,rf:12,rp:8,rs:2,re:1`
[3/0]	bcc	22	`lf:11,ls:11,rf:1,rp:1,rs:1,re:1,a:2`
[3/1]	cbc	18	`lf:18,rf:9,rp:2,a:6`
[3/2]	bcb	15	`lf:15,rf:9,rs:6,a:6`
[3/3]	bbc	8	`lf:4,lp:4,rf:1,rp:1,rs:1,re:1,a:17`
[3/4]	abc	8	`lf:4,lp:4,a:2`
[3/5]	acb	7	`lf:4,lp:3,rf:6,rs:2,lprs:1,a:6`
[3/6]	cbb	2	`lf:1,ls:1,a:12`

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

Step 2

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

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