Morphocompletion for #4311 ⟨a, b | ababbabba=ab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

Collecting factors up to length 8 / frequency 7:

[2/0]	bb	31	`lf:28,ls:3,rf:12,rs:2,a:2`
[2/1]	ab	22	`lf:14,lp:8,rf:10,rp:8,rs:3,re:1,lprp:8,lprs:3,a:2`
[2/2]	aa	13	`lf:9,ls:4,a:9`
[2/3]	ba	12	`lf:11,ls:1,rf:5,rs:3,a:2`
[3/0]	abb	21	`lf:11,lp:7,ls:3,rf:5,rp:5,rs:1,re:1,lprp:4,lsrp:3,lprs:1,a:2`
[3/1]	bbb	17	`lf:17,rf:7,rs:1,a:2`
[3/2]	bba	9	`lf:8,ls:1,rf:3,rs:3,a:2`
[3/3]	aaa	8	`lf:4,ls:4,a:23`
[3/4]	bab	5	`lf:5,rf:2,rs:2,a:2`
[3/5]	baa	5	`lf:5,a:9`
[3/6]	aba	4	`lf:3,lp:1,rf:2,rp:2,a:2`
[4/0]	abbb	12	`lf:6,lp:6,rf:4,rp:4,rs:1,re:1,lprp:2,lprs:1,a:2`
[4/1]	bbbb	11	`lf:11,rf:3,a:4`
[4/2]	baaa	8	`lf:4,ls:4,a:23`
[4/3]	babb	6	`lf:3,ls:3,a:2`
[4/4]	bbba	6	`lf:6,rf:3,rs:3,a:2`
[4/5]	bbab	4	`lf:4,a:4`
[4/6]	abba	4	`lf:2,lp:1,ls:1,a:4`
[5/0]	abbbb	8	`lf:4,lp:4,rf:2,rp:2,a:4`
[5/1]	bbbbb	7	`lf:7,rf:1,a:16`
[5/2]	bbaaa	6	`lf:3,ls:3,a:23`
[5/3]	bbabb	4	`lf:2,ls:2,a:4`
[5/4]	bbbba	4	`lf:4,rf:2,rs:2,a:4`
[5/5]	abbba	4	`lf:2,lp:2,rf:1,rp:1,rs:1,re:1,a:2`
[5/6]	bbbab	3	`lf:3,a:9`
[6/0]	abbbbb	8	`lf:4,lp:4,rf:1,rp:1,a:16`
[6/1]	bbbaaa	6	`lf:3,ls:3,a:23`
[6/2]	bbbbba	4	`lf:4,rf:1,rs:1,a:16`
[6/3]	abbbab	4	`lf:2,lp:2,a:9`
[6/4]	bbbbbb	3	`lf:3,a:23`
[6/5]	bbbbaa	3	`lf:3,a:23`
[6/6]	bbbabb	2	`lf:1,ls:1,a:16`
[7/0]	bbbbaaa	6	`lf:3,ls:3,a:23`
[7/1]	abbbbbb	4	`lf:2,lp:2,a:23`
[7/2]	abbbbba	4	`lf:2,lp:2,rf:1,rp:1,rs:1,re:1,a:16`
[7/3]	bbbbbaa	3	`lf:3,a:23`
[7/4]	bbbbbba	2	`lf:2,a:23`
[7/5]	abbbaba	2	`lf:1,lp:1,a:9`
[7/6]	bbbabaa	2	`lf:2,a:9`

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

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

Rewriting system is complete. See ⟨a, b | ababbabba=ab⟩.