Morphocompletion for #2904 ⟨a, b, c | aab=a, cbc=a⟩

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	cbc ⇒ a
2.	abc ⇒ cba
3.	aab ⇒ a
4.	acab ⇒ ac
5.	acba ⇒ ac
6.	accab ⇒ acc
7.	accba ⇒ acc
8.	acccab ⇒ accc
9.	acccba ⇒ accc
10.	accccab ⇒ acccc
11.	accccba ⇒ acccc
12.	acccccab ⇒ accccc
13.	acccccba ⇒ accccc
14.	accccccab ⇒ acccccc
15.	accccccba ⇒ acccccc
16.	acccccccab ⇒ accccccc
17.	acccccccba ⇒ accccccc
18.	accccccccab ⇒ acccccccc
19.	accccccccba ⇒ acccccccc
20.	acccccccccab ⇒ accccccccc
	...

Collecting factors up to length 4 / frequency 7:

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

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | aab=a, cbc=a⟩.