Morphocompletion for #3646 ⟨a, b | aabbabaaba=b⟩

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

#	Rule
1.	aabbabaaba ⇒ b
2.	aabbabaabb ⇒ babbabaaba
3.	babbabaabaabaaba ⇒ aabbabb
4.	aabbabaaaabbabb ⇒ bbbabaabaabaaba
5.	aabbabbabbabaaba ⇒ babbabaabaabaabb
6.	aabbabbbbabaabaabaaba ⇒ babbabaabaabaaaabbabb
7.	bbbabaabaabaabaabaabaabaaba ⇒ aabbabaaaabaabbabb
8.	babbabaabaabaabbabbabaaba ⇒ aabbabbabbabaabb
9.	aabbabbabbabaabbabbabaaba ⇒ babbabaabaabaabbabbabaabb
10.	babbabaabaabaabbbbabaabaabaaba ⇒ aabbabbabbabaaaabbabb
11.	babbabaabaabaabbabbabaabbabbabaaba ⇒ aabbabbabbabaabbabbabaabb
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	ba	86	`lf:73,lp:4,ls:9,rf:49,rp:4,rs:2,lsrp:3`
[2/1]	ab	70	`lf:70,rf:52`
[2/2]	aa	48	`lf:42,lp:6,rf:31,rp:5`
[2/3]	bb	36	`lf:33,lp:1,ls:2,rf:32,rp:1,rs:8,lsrp:1,lprs:1`
[3/0]	aba	52	`lf:43,ls:9,rf:22,rs:2`
[3/1]	aab	46	`lf:40,lp:6,rf:25,rp:5`
[3/2]	bab	34	`lf:30,lp:4,rf:27,rp:4`
[3/3]	baa	34	`lf:34,rf:20`
[3/4]	abb	29	`lf:27,ls:2,rf:30,rs:8`
[3/5]	bba	26	`lf:26,rf:23`
[3/6]	bbb	6	`lf:5,lp:1,rf:1,rp:1,a:4`
[4/0]	aaba	36	`lf:27,ls:9,rf:11,rs:2`
[4/1]	abaa	34	`lf:34,rf:20`
[4/2]	baab	33	`lf:33,rf:17`
[4/3]	bbab	26	`lf:26,rf:23`
[4/4]	abba	23	`lf:23,rf:22`
[4/5]	aabb	20	`lf:13,lp:6,ls:1,rf:14,rp:5,rs:4,lprs:2`
[4/6]	babb	19	`lf:14,lp:4,ls:1,rf:16,rp:4,rs:4,lprs:2,a:1`
[5/0]	baaba	36	`lf:27,ls:9,rf:10,rs:2`
[5/1]	abaab	33	`lf:33,rf:17`
[5/2]	abbab	23	`lf:23,rf:22`
[5/3]	aabaa	18	`lf:18,rf:9,a:2`
[5/4]	aabba	17	`lf:11,lp:6,rf:10,rp:5`
[5/5]	babba	16	`lf:12,lp:4,rf:12,rp:4,a:1`
[5/6]	bbaba	16	`lf:16,rf:11`
[6/0]	abaaba	36	`lf:27,ls:9,rf:10,rs:2`
[6/1]	aabaab	18	`lf:18,rf:8,a:2`
[6/2]	baabaa	18	`lf:18,rf:8,a:2`
[6/3]	aabbab	17	`lf:11,lp:6,rf:10,rp:5`
[6/4]	babbab	16	`lf:12,lp:4,rf:12,rp:4,a:1`
[6/5]	bbabaa	16	`lf:16,rf:11`
[6/6]	babaab	15	`lf:15,rf:9`
[7/0]	aabaaba	19	`lf:15,ls:4,rf:5,rs:1,a:2`
[7/1]	baabaab	18	`lf:18,rf:7,a:2`
[7/2]	abaabaa	18	`lf:18,rf:8,a:2`
[7/3]	babaaba	17	`lf:12,ls:5,rf:5,rs:1`
[7/4]	bbabaab	15	`lf:15,rf:9`
[7/5]	babbaba	14	`lf:10,lp:4,rf:9,rp:4,a:1`
[7/6]	abbabaa	13	`lf:13,rf:10`

Considering [length 2 / frequency 0] ba=c.

Step 2

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