Morphocompletion for #5631 ⟨a, b, c | aa=a, abc=ca⟩

Solved by morph:3/0. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Right-to-left recursive path with deg(a) = deg(b) = 0, a < b; deg(c) = 1

Rewriting system is not complete: lhsLimit

#	Rule
1.	aa ⇒ a
2.	ababc ⇒ abc
3.	ca ⇒ abc
4.	abcbabc ⇒ abcbc
5.	abcbcbabc ⇒ abcbcbc
6.	abcbcbcbabc ⇒ abcbcbcbc
7.	abcbcbcbcbabc ⇒ abcbcbcbcbc
8.	abcbcbcbcbcbabc ⇒ abcbcbcbcbcbc
9.	abcbcbcbcbcbcbabc ⇒ abcbcbcbcbcbcbc
10.	abcbcbcbcbcbcbcbabc ⇒ abcbcbcbcbcbcbcbc
11.	abcbcbcbcbcbcbcbcbabc ⇒ abcbcbcbcbcbcbcbcbc
12.	abcbcbcbcbcbcbcbcbcbabc ⇒ abcbcbcbcbcbcbcbcbcbc
13.	abcbcbcbcbcbcbcbcbcbcbabc ⇒ abcbcbcbcbcbcbcbcbcbcbc
14.	abcbcbcbcbcbcbcbcbcbcbcbabc ⇒ abcbcbcbcbcbcbcbcbcbcbcbc
15.	abcbcbcbcbcbcbcbcbcbcbcbcbabc ⇒ abcbcbcbcbcbcbcbcbcbcbcbcbc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bc	104	`lf:91,ls:13,rf:92,rs:14,lsrs:13,a:1`
[2/1]	cb	78	`lf:78,rf:78,a:3`
[2/2]	ab	39	`lf:26,lp:13,rf:14,rp:14,lprp:13,a:1`
[2/3]	ba	13	`lf:13,a:2`
[3/0]	bcb	78	`lf:78,rf:78,a:3`
[3/1]	cbc	66	`lf:66,rf:78,rs:12,a:3`
[3/2]	abc	50	`lf:25,lp:12,ls:13,rf:14,rp:14,rs:2,re:2,lprp:12,lsrp:13,lsrs:1,a:1`
[3/3]	bab	13	`lf:13,a:2`
[3/4]	cba	12	`lf:12,a:3`
[3/5]	aba	2	`lf:1,lp:1,a:2`

Considering [length 3 / frequency 0] bcb=d.

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

Rewriting system is complete. See ⟨a, b, c | aa=a, abc=ca⟩.