Morphocompletion for #3476 ⟨a, b, c | ba=ac, cbb=c⟩

Solved by morph:2/1. (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.	cbb ⇒ c
2.	ba ⇒ ac
3.	cabb ⇒ ca
4.	cacc ⇒ ca
5.	caabb ⇒ caa
6.	caacc ⇒ caa
7.	caaabb ⇒ caaa
8.	caaacc ⇒ caaa
9.	caaaabb ⇒ caaaa
10.	caaaacc ⇒ caaaa
11.	caaaaabb ⇒ caaaaa
12.	caaaaacc ⇒ caaaaa
13.	caaaaaabb ⇒ caaaaaa
14.	caaaaaacc ⇒ caaaaaa
15.	caaaaaaabb ⇒ caaaaaaa
16.	caaaaaaacc ⇒ caaaaaaa
17.	caaaaaaaabb ⇒ caaaaaaaa
18.	caaaaaaaacc ⇒ caaaaaaaa
19.	caaaaaaaaabb ⇒ caaaaaaaaa
20.	caaaaaaaaacc ⇒ caaaaaaaaa
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	aa	72	`lf:72,rf:72,rs:16,a:4`
[2/1]	ca	36	`lf:18,lp:18,rf:18,rp:18,rs:2,re:2,lprp:18,lprs:2,a:2`
[2/2]	bb	20	`lf:10,ls:10,a:1`
[2/3]	cc	18	`lf:9,ls:9,a:2`
[2/4]	ac	9	`lf:9,rf:1,rp:1,rs:1,re:1`
[2/5]	ab	9	`lf:9,a:3`
[2/6]	cb	2	`lf:1,lp:1,a:1`
[3/0]	aaa	56	`lf:56,rf:56,rs:14,a:6`
[3/1]	caa	32	`lf:16,lp:16,rf:16,rp:16,rs:2,re:2,lprp:16,lprs:2,a:4`
[3/2]	acc	18	`lf:9,ls:9,a:2`
[3/3]	abb	18	`lf:9,ls:9,a:3`
[3/4]	aac	8	`lf:8,a:4`
[3/5]	aab	8	`lf:8,a:5`
[3/6]	cac	2	`lf:1,lp:1,a:2`

Considering [length 2 / frequency 1] ca=d.

Step 2

Auxiliary generators:
1. d = ca
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 | ba=ac, cbb=c⟩.