Morphocompletion for #5166 ⟨a, b | aababaa=aaab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

Collecting factors up to length 7 / frequency 4:

Considering [length 6 / frequency 0] bbabaa=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6 / frequency 7:

[2/0]	aa	48	`lf:34,lp:7,ls:7,rf:32,rp:7,rs:6,lprp:7,lsrp:2,lprs:2`
[2/1]	ca	29	`lf:19,lp:10,rf:22,rp:11,lprp:10,a:3`
[2/2]	ab	28	`lf:19,ls:9,rf:6,rs:4`
[2/3]	ac	16	`lf:13,ls:3,rf:19,rs:8,a:2`
[2/4]	ba	13	`lf:13,rf:2`
[2/5]	cb	3	`lf:2,lp:1,a:4`
[2/6]	bb	2	`lf:1,lp:1,a:1`
[3/0]	caa	23	`lf:13,lp:6,ls:4,rf:11,rp:4,rs:4,lprp:3,lsrp:2,lprs:3,a:12`
[3/1]	aab	15	`lf:9,lp:1,ls:5,rf:1,rs:1,lprs:1`
[3/2]	aaa	15	`lf:9,lp:6,rf:12,rp:7,lprp:6`
[3/3]	cab	10	`lf:5,lp:3,ls:2,rf:5,rp:1,rs:3,re:1,lprs:1,a:3`
[3/4]	aba	10	`lf:10,rf:2`
[3/5]	aac	9	`lf:9,rf:13,rs:7,a:2`
[3/6]	baa	8	`lf:5,ls:3,rf:2,rs:2`
[4/0]	caac	11	`lf:7,lp:4,rf:3,rp:3,rs:1,re:1,lprp:1,a:14`
[4/1]	aaab	10	`lf:5,lp:3,ls:2,rf:1,rp:1,rs:1,re:1`
[4/2]	acaa	9	`lf:6,ls:3,rf:6,rs:3,a:12`
[4/3]	abaa	8	`lf:5,ls:3,rf:2,rs:2`
[4/4]	aaca	7	`lf:7,rf:5,a:3`
[4/5]	caba	6	`lf:3,lp:3,rf:2,a:3`
[4/6]	abab	5	`lf:3,ls:2`
[5/0]	aacaa	8	`lf:5,ls:3,rf:3,rs:2,a:12`
[5/1]	caaca	7	`lf:5,lp:2,rf:1,rp:1,a:14`
[5/2]	babaa	6	`lf:3,ls:3`
[5/3]	aaaba	6	`lf:3,lp:3,a:2`
[5/4]	aabab	4	`lf:2,lp:1,ls:1`
[5/5]	abaab	4	`lf:2,ls:2,a:3`
[5/6]	aacab	4	`lf:2,ls:2,rf:2,rs:1,a:3`

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

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

Rewriting system is complete. See ⟨a, b | aababaa=aaab⟩.