Morphocompletion for #950 ⟨a, b | aabbaab=ba⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	aabbaab ⇒ ba
2.	aabbba ⇒ babaab
3.	babaababbaab ⇒ aabbbba
4.	aabbaaaabbbba ⇒ baabaababbaab
5.	babaababbba ⇒ aabbbbabaab
6.	aabaabbaaaabbbbba ⇒ baaababbaababbaab
7.	baabaababbaababbaab ⇒ aabbaaaabbbbba
8.	aabbaaaabbaaaabbbbba ⇒ baaabaababbaababbaab
9.	babaababbaaaabbbba ⇒ aabbbbaabaababbaab
10.	baabaababbaababbba ⇒ aabbaaaabbbbbabaab
11.	baaababbaababbaababbaab ⇒ aabaabbaaaabbbbbba
12.	aabbaaaabaabbaaaabbbbbba ⇒ baaaababbaababbaababbaab
13.	babaababaabbaaaabbbbba ⇒ aabbbbaaababbaababbaab
14.	baaababbaababbaababbba ⇒ aabaabbaaaabbbbbbabaab
15.	baaabaababbaababbaababbaab ⇒ aabbaaaabbaaaabbbbbba
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	ba	86	`lf:67,lp:9,ls:10,rf:52,rp:6,rs:5,re:1,lsrp:5,lprs:4`
[2/1]	ab	68	`lf:63,ls:5,rf:56,rs:10`
[2/2]	aa	67	`lf:61,lp:6,rf:58,rp:9`
[2/3]	bb	52	`lf:52,rf:52`
[3/0]	aab	53	`lf:42,lp:6,ls:5,rf:41,rp:9,rs:10,lsrp:4,lprs:5`
[3/1]	bba	41	`lf:31,ls:10,rf:26,rs:4`
[3/2]	baa	41	`lf:36,lp:5,rf:32,rp:4`
[3/3]	abb	31	`lf:31,rf:26`
[3/4]	aba	27	`lf:27,rf:20,a:1`
[3/5]	bab	25	`lf:21,lp:4,rf:15,rp:1,a:1`
[3/6]	bbb	21	`lf:21,rf:26,a:1`
[4/0]	baab	32	`lf:25,lp:2,ls:5,rf:22,rp:1,rs:10,lprs:1`
[4/1]	aaba	23	`lf:22,lp:1,rf:16,rp:2,a:2`
[4/2]	bbaa	21	`lf:21,rf:19`
[4/3]	abba	21	`lf:21,rf:17`
[4/4]	bbba	20	`lf:10,ls:10,rf:9,rs:4,a:1`
[4/5]	aabb	20	`lf:15,lp:5,rf:15,rp:7`
[4/6]	abab	17	`lf:17,rf:11,a:2`
[5/0]	abbaa	21	`lf:21,rf:17`
[5/1]	baaba	19	`lf:17,lp:2,rf:10,rp:1,a:2`
[5/2]	bbaab	18	`lf:13,ls:5,rf:12,rs:6`
[5/3]	aabab	17	`lf:17,rf:11,a:2`
[5/4]	ababb	16	`lf:16,rf:11,a:2`
[5/5]	babba	13	`lf:13,rf:11,a:2`
[5/6]	bbbba	12	`lf:6,ls:6,rf:9,rs:4,a:2`
[6/0]	abbaab	18	`lf:13,ls:5,rf:11,rs:6`
[6/1]	aababb	16	`lf:16,rf:11,a:2`
[6/2]	baabab	15	`lf:15,rf:8,a:2`
[6/3]	babbaa	13	`lf:13,rf:11,a:2`
[6/4]	ababba	13	`lf:13,rf:11,a:2`
[6/5]	aabbaa	12	`lf:8,lp:4,rf:6,rp:3`
[6/6]	babaab	9	`lf:5,lp:4,rf:4,rp:1,rs:4,re:1,lprs:1,a:1`
[7/0]	babbaab	16	`lf:12,ls:4,rf:11,rs:6,a:2`
[7/1]	baababb	14	`lf:14,rf:8,a:2`
[7/2]	ababbaa	13	`lf:13,rf:11,a:2`
[7/3]	aababba	13	`lf:13,rf:11,a:2`
[7/4]	aabbaaa	10	`lf:7,lp:3,rf:6,rp:3,a:4`
[7/5]	bbaabab	8	`lf:8,rf:5,a:6`
[7/6]	babaaba	8	`lf:4,lp:4,a:2`

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

Step 2

Auxiliary generators:
1. c = baab
Reduction order:
- Right-to-left recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1

Rewriting system is complete. See ⟨a, b | aabbaab=ba⟩.