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

Rewriting system is not complete: roundsLimit

#	Rule
1.	aac ⇒ caa
2.	aba ⇒ b
3.	ccaa ⇒ 1
4.	acc ⇒ cca
5.	baac ⇒ bcaa
6.	abcaa ⇒ bac
7.	abb ⇒ bba
8.	ccacaa ⇒ ac
9.	ccb ⇒ baa
10.	ccab ⇒ ba
11.	bcc ⇒ aab
12.	bcaac ⇒ b
13.	abcacaa ⇒ bacac
14.	abcb ⇒ bacbaa
15.	abcab ⇒ bacba
16.	ccacacaa ⇒ acac
17.	ccacb ⇒ acbaa
18.	ccacab ⇒ acba
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	18	`lf:9,lp:7,ls:2,rf:1,rp:1,lsrp:10,a:5`
[2/1]	ab	18	`lf:9,lp:6,ls:3,rf:1,rs:1`
[2/2]	ca	15	`lf:15,rf:5,rp:1,rs:1,a:5`
[2/3]	ac	14	`lf:10,lp:1,ls:3,rf:10,rp:4,rs:4,re:1,a:5`
[2/4]	aa	14	`lf:8,lp:1,ls:5,rf:6,rp:1,rs:5,lprs:10,a:6`
[2/5]	bc	8	`lf:6,lp:2,rf:1,rp:1,a:6`
[2/6]	cb	6	`lf:3,ls:3,rf:4,a:10`
[3/0]	cca	12	`lf:6,lp:6,rf:1,rp:1,rs:1,re:1,a:5`
[3/1]	caa	11	`lf:6,ls:5,rf:2,rp:1,rs:2,re:1,a:7`
[3/2]	abc	8	`lf:4,lp:4,a:17`
[3/3]	cab	6	`lf:3,ls:3,a:9`
[3/4]	cac	6	`lf:6,rf:2,rs:2,a:8`
[3/5]	bca	5	`lf:4,lp:1,rf:1,rp:1,a:17`
[3/6]	aca	5	`lf:5,rf:2,rp:1,a:8`

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

Step 2

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

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