Morphocompletion for #401 ⟨a, b | ababaab=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaabb ⇒ ababa
2.	aabaab ⇒ ababaa
3.	ababaab ⇒ a
4.	ababaaab ⇒ aaababba
5.	aaababbab ⇒ ababababa
6.	abaaababb ⇒ aaababbba
7.	ababababaa ⇒ aaab
8.	ababaaaab ⇒ aabababaa
9.	aaababbaab ⇒ aaabababba
10.	aaababbbaab ⇒ abababababa
11.	aaababbaabb ⇒ aaababbbaba
12.	aaababbbabaa ⇒ aaabab
13.	ababababababa ⇒ aaababb
14.	aaababbaaab ⇒ aabaa
15.	aaababbbababaa ⇒ abaaabab
16.	aaababbbaaaab ⇒ abaabaa
17.	aaabababbaaab ⇒ ababaaa
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	ab	70	`lf:54,lp:6,ls:10,rf:39,rp:7,rs:3,lsrp:5,lprs:1`
[2/1]	aa	57	`lf:43,lp:11,ls:3,rf:25,rp:9,rs:5,lprp:4,lsrp:2,lprs:4`
[2/2]	ba	42	`lf:41,ls:1,rf:35,rs:7`
[2/3]	bb	19	`lf:16,ls:3,rf:7,rs:1,a:5`
[3/0]	aba	39	`lf:32,lp:6,ls:1,rf:31,rp:7,rs:4`
[3/1]	aab	32	`lf:22,lp:1,ls:9,rf:11,rp:2,rs:1,lsrp:2`
[3/2]	aaa	28	`lf:18,lp:10,rf:9,rp:7,rs:1,lprp:3,lprs:1,a:2`
[3/3]	bab	27	`lf:26,ls:1,rf:21,rs:2`
[3/4]	baa	17	`lf:14,ls:3,rf:7,rs:4`
[3/5]	abb	15	`lf:12,ls:3,rf:5,rs:1,a:5`
[3/6]	bba	9	`lf:9,rf:4,rs:3,a:9`
[4/0]	aaab	31	`lf:16,lp:10,ls:5,rf:8,rp:7,rs:1,re:1,lprp:3,lsrp:1,a:2`
[4/1]	abab	28	`lf:23,lp:5,rf:20,rp:5,rs:2`
[4/2]	baba	16	`lf:15,ls:1,rf:14,rs:4`
[4/3]	aaba	12	`lf:11,lp:1,rf:10,rp:2,a:1`
[4/4]	abaa	12	`lf:8,lp:1,ls:3,rf:7,rp:2,rs:4,lsrp:1`
[4/5]	babb	11	`lf:10,ls:1,rf:5,rs:1,a:6`
[4/6]	baab	9	`lf:5,ls:4,rf:1`
[5/0]	aaaba	19	`lf:10,lp:9,rf:7,rp:6,lprp:3,a:6`
[5/1]	ababa	19	`lf:13,lp:5,ls:1,rf:13,rp:5,rs:3,re:1`
[5/2]	ababb	11	`lf:10,ls:1,rf:5,rs:1,a:6`
[5/3]	aabab	10	`lf:10,rf:8,rp:1,rs:2,a:3`
[5/4]	babaa	9	`lf:6,ls:3,rf:3,rs:2`
[5/5]	babab	8	`lf:8,rf:7,a:2`
[5/6]	baaab	7	`lf:4,ls:3,rf:1,a:9`
[6/0]	aaabab	19	`lf:10,lp:9,rf:7,rp:6,rs:2,re:1,lprp:3,lprs:2,a:6`
[6/1]	ababaa	10	`lf:5,lp:3,ls:2,rf:3,rp:2,rs:2,re:1,lprs:1`
[6/2]	aababb	10	`lf:9,ls:1,rf:4,rs:1,a:6`
[6/3]	ababab	9	`lf:7,lp:2,rf:7,rp:2,a:2`
[6/4]	bababa	8	`lf:7,ls:1,rf:6,rs:2,a:2`
[6/5]	ababba	5	`lf:5,rf:2,rs:2,a:9`
[6/6]	abaaab	4	`lf:2,lp:1,ls:1,rf:1,rp:1,a:9`
[7/0]	aaababb	18	`lf:9,lp:8,ls:1,rf:4,rp:4,rs:1,re:1,lprp:1,lsrp:1,a:6`
[7/1]	abababa	9	`lf:6,lp:2,ls:1,rf:6,rp:2,rs:2,a:2`
[7/2]	ababaaa	4	`lf:2,lp:2,rf:1,rp:1,rs:1,re:1,a:3`
[7/3]	abbaaab	4	`lf:2,ls:2,a:16`
[7/4]	aababba	4	`lf:4,rf:1,rs:1,a:9`
[7/5]	ababbaa	4	`lf:4,a:16`
[7/6]	bababaa	4	`lf:2,ls:2,rf:1,rs:1,a:2`

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

Step 2

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

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