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

Rewriting system is not complete: roundsLimit

#	Rule
1.	cca ⇒ acc
2.	ccb ⇒ bcc
3.	aacc ⇒ 1
4.	caa ⇒ aac
5.	bb ⇒ aa
6.	aacacc ⇒ ca
7.	aabcc ⇒ b
8.	aacbcc ⇒ cb
9.	baa ⇒ aab
10.	aacacacc ⇒ caca
11.	aacabcc ⇒ cab
12.	aacacbcc ⇒ cacb
13.	aabacc ⇒ ba
14.	aabcacc ⇒ bca
15.	aacbacc ⇒ cba
16.	aacbcacc ⇒ cbca
17.	aabcbcc ⇒ bcb
18.	aababcc ⇒ bab
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	aa	30	`lf:15,lp:13,ls:2,rf:3,rp:3,rs:1,re:1,lsrp:20`
[2/1]	cc	30	`lf:15,lp:2,ls:13,rf:2,rs:2,lprs:20,a:2`
[2/2]	ac	16	`lf:16,rf:4,rp:1,rs:1,a:2`
[2/3]	ca	11	`lf:9,lp:1,ls:1,rf:7,rp:4,rs:4,re:1,a:2`
[2/4]	bc	9	`lf:9,rf:4,rp:3,a:12`
[2/5]	ab	7	`lf:7,rf:3,rs:3,a:3`
[2/6]	cb	7	`lf:6,ls:1,rf:5,rp:3,rs:3,re:1,a:12`
[3/0]	aac	16	`lf:8,lp:8,rf:1,rp:1,rs:1,re:1,a:15`
[3/1]	acc	14	`lf:7,ls:7,rf:1,rp:1,rs:1,re:1,a:2`
[3/2]	bcc	12	`lf:6,ls:6,rf:1,rp:1,rs:1,re:1,a:12`
[3/3]	aab	10	`lf:5,lp:5,rf:1,rp:1,rs:1,re:1,a:3`
[3/4]	cac	6	`lf:6,rf:2,rp:2,a:17`
[3/5]	abc	5	`lf:5,a:13`
[3/6]	aca	5	`lf:5,rf:1,rs:1,a:17`

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

Step 2

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

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