Morphocompletion for #5938 ⟨a, b, c | ab=a, cba=bc⟩

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(a) = deg(b) = 0, a < b; deg(c) = 1

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ a
2.	aca ⇒ ac
3.	acb ⇒ ac
4.	bc ⇒ cba
5.	acca ⇒ acc
6.	accb ⇒ acc
7.	accca ⇒ accc
8.	acccb ⇒ accc
9.	acccca ⇒ acccc
10.	accccb ⇒ acccc
11.	accccca ⇒ accccc
12.	acccccb ⇒ accccc
13.	acccccca ⇒ acccccc
14.	accccccb ⇒ acccccc
15.	accccccca ⇒ accccccc
16.	acccccccb ⇒ accccccc
17.	acccccccca ⇒ acccccccc
18.	accccccccb ⇒ acccccccc
19.	accccccccca ⇒ accccccccc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	64	`lf:64,rf:64,rs:15,a:6`
[2/1]	ac	34	`lf:17,lp:17,rf:17,rp:17,rs:2,re:2,lprp:17,lprs:2,a:3`
[2/2]	ca	18	`lf:9,ls:9,a:5`
[2/3]	cb	16	`lf:8,ls:8,rf:1,rp:1,a:1`
[2/4]	ba	0	`rf:1,rs:1,a:1`
[3/0]	ccc	49	`lf:49,rf:49,rs:13,a:8`
[3/1]	acc	30	`lf:15,lp:15,rf:15,rp:15,rs:2,re:2,lprp:15,lprs:2,a:6`
[3/2]	cca	16	`lf:8,ls:8,a:7`
[3/3]	ccb	14	`lf:7,ls:7,a:6`
[3/4]	cba	0	`rf:1,rp:1,rs:1,re:1,a:1`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | ab=a, cba=bc⟩.