Morphocompletion for #3109 ⟨a, b, c | ab=aa, bccb=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(c) = 0; deg(a) = deg(b) = 1, a < b

Rewriting system is not complete: roundsLimit

#	Rule
1.	bcc ⇒ ccb
2.	ab ⇒ aa
3.	accb ⇒ aacc
4.	accccb ⇒ aacccc
5.	accccccb ⇒ aacccccc
6.	accccccccb ⇒ aacccccccc
7.	accccccccccb ⇒ aacccccccccc
8.	ccbb ⇒ 1
9.	bbc ⇒ cbb
10.	aaacc ⇒ a
11.	acbb ⇒ aaac
12.	ccbcbb ⇒ bc
13.	acbcbb ⇒ aaacbc
14.	ccbcbcbb ⇒ bcbc
15.	acbcbcbb ⇒ aaacbcbc
16.	ccbcbcbcbb ⇒ bcbcbc
17.	acbcbcbcbb ⇒ aaacbcbcbc
18.	ccbcbcbcbcbb ⇒ bcbcbcbc
19.	acbcbcbcbcbb ⇒ aaacbcbcbcbc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cb	40	`lf:35,ls:5,rf:18,rp:1,rs:1,a:3`
[2/1]	cc	39	`lf:32,lp:5,ls:2,rf:26,rp:1,rs:5,lsrp:10,a:2`
[2/2]	bc	24	`lf:22,lp:1,ls:1,rf:20,rp:4,rs:8,re:1,a:3`
[2/3]	bb	22	`lf:11,lp:1,ls:10,rf:1,rs:1,lprs:10,a:5`
[2/4]	ac	21	`lf:11,lp:10,rf:10,rs:1,lprs:1,a:2`
[2/5]	aa	3	`lf:2,lp:1,rf:16,rp:11,rs:1,re:1`
[3/0]	bcb	20	`lf:20,rf:12,rp:3,a:6`
[3/1]	cbb	20	`lf:10,ls:10,rf:1,rp:1,rs:1,re:1,a:5`
[3/2]	cbc	20	`lf:20,rf:16,rs:7,a:6`
[3/3]	ccb	20	`lf:10,lp:5,ls:5,rf:1,rp:1,rs:1,re:1,a:3`
[3/4]	ccc	20	`lf:20,rf:20,rs:4,a:8`
[3/5]	acc	12	`lf:6,lp:5,ls:1,rf:5,rs:1,lprs:10,a:2`
[3/6]	acb	10	`lf:5,lp:5,rf:4,a:7`

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

Step 2

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

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