Morphocompletion for #4186 ⟨a, b, c | aab=1, abca=c⟩

Solved by morph:2/0,2/0. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 4 / frequency 4:

[2/0]	cb	30	`lf:15,lp:13,ls:2,rf:12,rp:12,rs:2,re:2,lprp:9,lsrp:11,lprs:2,a:3`
[2/1]	aa	18	`lf:9,lp:1,ls:8`
[2/2]	ab	12	`lf:7,lp:1,ls:4`
[2/3]	ba	11	`lf:9,ls:2,rf:4,rs:4,a:3`
[3/0]	cbb	12	`lf:6,lp:6,rf:5,rp:5,rs:2,re:2,lprp:3,lprs:2,a:10`
[3/1]	caa	10	`lf:5,ls:5,a:5`
[3/2]	cbc	8	`lf:4,lp:4,rf:3,rp:3,rs:2,re:2,a:5`
[3/3]	bab	6	`lf:4,ls:2,a:16`

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6 / frequency 3:

Considering [length 2 / frequency 0] ab=e.

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

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