Morphocompletion for #3634 ⟨a, b | aabbaabaab=b⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaaabbb ⇒ baabaab
2.	aabbaabb ⇒ bbaabaab
3.	aabbaabaab ⇒ b
4.	aabbbaabaab ⇒ baaaabaabbb
5.	aabaaaabaabbb ⇒ baabaabaabaab
6.	aaaabaabbbaab ⇒ baaaaaabaabbb
7.	bbaabaabaabaab ⇒ aabbb
8.	aabbbbaabaab ⇒ bbaabaabaabb
9.	aabbaaaabaabbb ⇒ baaaabaabaabbb
10.	bbaabaaaaaabaabbb ⇒ aabaabbb
11.	baabaabaabaabaabaab ⇒ aaaabaabbb
12.	aabbbaaaabaabbb ⇒ bbaabb
13.	aabbbbaaaaaabaabbb ⇒ bbaabbaab
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	aa	68	`lf:58,lp:10,rf:36,rp:3`
[2/1]	ab	46	`lf:40,ls:6,rf:26,rs:4`
[2/2]	bb	39	`lf:30,lp:2,ls:7,rf:19,rp:4,rs:8,lsrp:3,lprs:2,lsrs:3`
[2/3]	ba	31	`lf:30,lp:1,rf:23,rp:5`
[3/0]	aab	54	`lf:40,lp:8,ls:6,rf:26,rp:2,rs:4,lsrp:1,lprs:3`
[3/1]	baa	31	`lf:30,lp:1,rf:23,rp:5`
[3/2]	aaa	20	`lf:18,lp:2,rf:10,rp:1,a:4`
[3/3]	bbb	19	`lf:13,ls:6,rf:6,rs:6,lsrs:2,a:2`
[3/4]	aba	19	`lf:19,rf:13`
[3/5]	abb	16	`lf:15,ls:1,rf:9,rs:2`
[3/6]	bba	12	`lf:10,lp:2,rf:5,rp:4`
[4/0]	baab	32	`lf:25,lp:1,ls:6,rf:20,rp:2,rs:4`
[4/1]	aabb	23	`lf:15,lp:7,ls:1,rf:9,rp:1,rs:2,lprs:2`
[4/2]	aaba	20	`lf:19,lp:1,rf:13,rp:1`
[4/3]	abaa	19	`lf:19,rf:13`
[4/4]	abbb	17	`lf:11,ls:6,rf:6,rs:6,lsrs:2,a:2`
[4/5]	aaaa	13	`lf:11,lp:2,rf:6,rp:1,a:4`
[4/6]	bbaa	12	`lf:10,lp:2,rf:5,rp:4`
[5/0]	abaab	22	`lf:17,ls:5,rf:13,rs:3`
[5/1]	aabbb	21	`lf:11,lp:4,ls:6,rf:6,rp:1,rs:6,re:1,lprs:1,lsrs:2,a:2`
[5/2]	aabaa	20	`lf:19,lp:1,rf:13,rp:1`
[5/3]	baaba	13	`lf:12,lp:1,rf:8,rp:2`
[5/4]	bbaab	10	`lf:7,lp:2,ls:1,rf:5,rp:4,rs:1`
[5/5]	aaaab	9	`lf:7,lp:2,rf:4,rp:1,a:4`
[5/6]	baabb	8	`lf:7,ls:1,rf:8,rs:2,a:1`
[6/0]	aabaab	22	`lf:17,ls:5,rf:13,rp:1,rs:3`
[6/1]	baabaa	13	`lf:12,lp:1,rf:8,rp:2`
[6/2]	baabbb	11	`lf:6,ls:5,rf:5,rs:5,lsrs:2,a:6`
[6/3]	bbaaba	7	`lf:5,lp:2,rf:2,rp:2`
[6/4]	aaaaba	7	`lf:6,lp:1,rf:4,rp:1,a:6`
[6/5]	abaabb	6	`lf:6,rf:6,rs:1,a:3`
[6/6]	aabbaa	6	`lf:3,lp:3,rf:1`
[7/0]	baabaab	17	`lf:11,lp:1,ls:5,rf:8,rp:2,rs:3,re:1`
[7/1]	abaabbb	11	`lf:6,ls:5,rf:5,rs:5,lsrs:2,a:6`
[7/2]	bbaabaa	7	`lf:5,lp:2,rf:2,rp:2`
[7/3]	aaaabaa	7	`lf:6,lp:1,rf:4,rp:1,a:6`
[7/4]	aabaabb	6	`lf:6,rf:6,rp:1,rs:1,a:3`
[7/5]	aaabaab	6	`lf:6,rf:4,a:6`
[7/6]	aabaaba	6	`lf:6,rf:4,a:2`

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

Step 2

Auxiliary generators:
1. c = aab
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 | aabbaabaab=b⟩.