Morphocompletion for #2777 ⟨a, b, c | abc=b, acca=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(b) = deg(c) = 0, b < c; deg(a) = 1

Rewriting system is not complete: roundsLimit

#	Rule
1.	ccb ⇒ bcc
2.	abc ⇒ b
3.	abbcc ⇒ bcb
4.	abbbcc ⇒ bcbb
5.	bcab ⇒ abbc
6.	cca ⇒ acc
7.	bcbab ⇒ abbbc
8.	aacc ⇒ 1
9.	aabbc ⇒ bab
10.	aacbc ⇒ cab
11.	aabbbc ⇒ bbab
12.	aacbbc ⇒ cbab
13.	aacbcc ⇒ cb
14.	abacc ⇒ bca
15.	baa ⇒ aab
16.	caa ⇒ aac
17.	bcaa ⇒ ab
18.	aacacc ⇒ ca
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	aa	20	`lf:10,lp:7,ls:3,rf:2,rp:2,lsrp:20,a:11`
[2/1]	bc	19	`lf:11,lp:3,ls:5,rf:6,rp:4,rs:2,lprs:2`
[2/2]	cc	16	`lf:8,lp:2,ls:6,rf:2,rs:2,lprs:20,a:3`
[2/3]	ab	14	`lf:8,lp:4,ls:2,rf:8,rp:3,rs:6,re:1,lsrp:2`
[2/4]	ca	7	`lf:5,lp:1,ls:1,rf:3,rp:2,rs:2,re:1,a:3`
[2/5]	ac	7	`lf:7,rf:2,rp:1,rs:1,a:3`
[2/6]	bb	7	`lf:7,rf:5,rp:1,rs:1,a:5`
[3/0]	aac	10	`lf:5,lp:5,rf:1,rp:1,rs:1,re:1,a:18`
[3/1]	bbc	8	`lf:5,ls:3,rf:2,rs:2,a:5`
[3/2]	acc	6	`lf:3,ls:3,rf:1,rp:1,rs:1,re:1,a:3`
[3/3]	abb	6	`lf:4,lp:2,rf:2,rp:2,a:5`
[3/4]	bcc	6	`lf:3,ls:3,rf:1,rp:1,rs:1,re:1,a:4`
[3/5]	aab	4	`lf:2,lp:2,rf:1,rp:1,rs:1,re:1,a:16`
[3/6]	bca	4	`lf:2,lp:2,rf:1,rp:1,rs:1,re:1,a:6`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | abc=b, acca=1⟩.