Morphocompletion for #1328 ⟨a, b | aaaabbabba=1⟩

Solved by morph:4/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:

[2/0]	aa	31	`lf:25,lp:1,ls:5,rf:10,rp:2,rs:1,lsrp:2,lprs:1,lsrs:1,a:9`
[2/1]	bb	24	`lf:19,lp:4,ls:1,rf:9,rp:3,rs:4,lsrp:1,lprs:3,a:9`
[2/2]	ba	15	`lf:14,ls:1,rf:5,rs:1,a:9`
[2/3]	ab	13	`lf:11,lp:2,rf:6,rp:1,a:9`
[3/0]	aaa	23	`lf:17,lp:1,ls:5,rf:6,rp:1,rs:1,lsrp:1,lprs:1,lsrs:1,a:9`
[3/1]	bba	19	`lf:14,lp:4,ls:1,rf:5,rp:3,rs:1,lsrp:1,a:9`
[3/2]	abb	14	`lf:11,lp:2,ls:1,rf:6,rp:1,rs:4,re:1,lprs:1,a:9`
[3/3]	baa	7	`lf:7,rf:2,a:9`
[4/0]	aaaa	15	`lf:10,lp:1,ls:4,rf:4,rs:1,lprs:1,a:9`
[4/1]	bbab	10	`lf:6,lp:4,rf:2,rp:2,a:15`
[4/2]	abba	10	`lf:8,lp:1,ls:1,rf:2,rs:1,lprs:1,a:9`
[4/3]	babb	7	`lf:6,ls:1,rf:2,a:15`
[5/0]	bbabb	11	`lf:6,lp:4,ls:1,rf:2,rp:2,lsrp:10,a:15`
[5/1]	bbaaa	7	`lf:6,ls:1,rf:1,rp:1,lsrp:1,a:9`
[5/2]	aaaaa	7	`lf:5,ls:2,rf:3,rs:1,a:9`
[5/3]	abbaa	6	`lf:6,rf:1,a:9`
[6/0]	bbabba	8	`lf:4,lp:3,ls:1,rf:2,rp:2,rs:1,re:1,lsrp:1,a:15`
[6/1]	abbaaa	6	`lf:5,ls:1,a:9`
[6/2]	bbaaaa	6	`lf:4,ls:2,rf:1,rp:1,a:9`
[6/3]	aaaaaa	4	`lf:3,ls:1,rf:2,rs:1,a:9`

Considering [length 4 / frequency 0] aaaa=c.

Checking up to 20 rules for overlaps.

Auxiliary generators:
1. c = aaaa
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 6 / frequency 7:

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

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

Rewriting system is complete. See ⟨a, b | aaaabbabba=1⟩.