Morphocompletion for #2623 ⟨a, b, c | aba=b, caac=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) = deg(a) = 0, c < a; deg(b) = 1

Rewriting system is not complete: roundsLimit

#	Rule
1.	acc ⇒ cca
2.	aac ⇒ caa
3.	ccaa ⇒ 1
4.	ccacaa ⇒ ac
5.	ccacacaa ⇒ acac
6.	ccacacacaa ⇒ acacac
7.	bacc ⇒ bcca
8.	ab ⇒ bcca
9.	ccb ⇒ baa
10.	ccbcc ⇒ b
11.	ccacb ⇒ acbaa
12.	ccacacb ⇒ acacbaa
13.	ccacacacb ⇒ acacacbaa
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	24	`lf:12,lp:9,ls:3,rf:3,rp:1,lsrp:10,a:6`
[2/1]	ac	17	`lf:15,lp:1,ls:1,rf:12,rp:6,rs:3,re:1,a:2`
[2/2]	ca	16	`lf:16,rf:10,rp:1,rs:3,a:2`
[2/3]	aa	10	`lf:5,lp:1,ls:4,rf:5,rs:5,lprs:10,a:2`
[2/4]	cb	9	`lf:5,ls:4,rf:3,a:30`
[2/5]	ba	2	`lf:1,lp:1,rf:4,rp:1,a:15`
[2/6]	bc	1	`lf:1,rf:2,rp:2,a:6`
[3/0]	cca	14	`lf:7,lp:7,rf:3,rp:1,rs:3,re:1,a:6`
[3/1]	cac	12	`lf:12,rf:6,rs:2,a:29`
[3/2]	aca	9	`lf:9,rf:6,rp:4,a:29`
[3/3]	caa	8	`lf:4,ls:4,rf:1,rp:1,rs:1,re:1,a:2`
[3/4]	acb	6	`lf:3,ls:3,rf:3,rp:1,lsrp:1,a:37`
[3/5]	ccb	2	`lf:1,lp:1,a:30`
[3/6]	bac	2	`lf:1,lp:1,a:15`

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

Step 2

Auxiliary generators:
1. d = cc
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 | aba=b, caac=1⟩.