Morphocompletion for #851 ⟨a, b | ababbaab=a⟩

Solved by morph:6/1. (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: roundsLimit

#	Rule
1.	aaabb ⇒ aabba
2.	abaabb ⇒ ababba
3.	abaabba ⇒ ababbaa
4.	aaaab ⇒ abaaa
5.	abaaab ⇒ aabbaa
6.	aabbaab ⇒ ababbaa
7.	ababbaab ⇒ a
8.	aaababb ⇒ aabbaba
9.	abaababb ⇒ ababbaba
10.	aabbaaab ⇒ aababbaa
11.	ababbaaab ⇒ abababbaa
12.	aaabaabb ⇒ aabbabaa
13.	aaabababb ⇒ aabbababa
14.	abaabababb ⇒ ababbababa
15.	aabbababbaa ⇒ aaab
16.	ababbababbaa ⇒ abaab
17.	aabbabababbaa ⇒ aaabab
18.	ababbabababbaa ⇒ abaabab
19.	aabbababbabaaa ⇒ aaabaab
20.	ababbababbabaaa ⇒ abaabaab
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	ab	73	`lf:57,lp:10,ls:6,rf:41,rp:10,rs:6,lprp:8,lsrp:3,lprs:3`
[2/1]	aa	53	`lf:37,lp:10,ls:6,rf:25,rp:9,rs:7,lprp:8,lsrp:3,lprs:4`
[2/2]	ba	45	`lf:44,ls:1,rf:35,rs:6`
[2/3]	bb	31	`lf:24,ls:7,rf:12`
[3/0]	aba	37	`lf:27,lp:10,rf:23,rp:10,rs:4,lprp:8,lprs:2`
[3/1]	aab	31	`lf:20,lp:5,ls:6,rf:14,rp:6,rs:4,lprp:1,lsrp:2,lprs:2`
[3/2]	abb	31	`lf:24,ls:7,rf:12`
[3/3]	bab	27	`lf:27,rf:17,rs:2`
[3/4]	baa	20	`lf:16,ls:4,rf:12,rs:6`
[3/5]	aaa	18	`lf:11,lp:5,ls:2,rf:4,rp:3,rs:1,lsrp:1,lprs:1,a:3`
[3/6]	bba	18	`lf:17,ls:1,rf:12,rs:2`
[4/0]	abab	24	`lf:19,lp:5,rf:12,rp:6,rs:2,lprp:1,lprs:1`
[4/1]	babb	19	`lf:15,ls:4,rf:7`
[4/2]	abba	18	`lf:17,ls:1,rf:12,rs:2`
[4/3]	aabb	17	`lf:9,lp:5,ls:3,rf:5,rp:5,lsrp:11,a:1`
[4/4]	aaab	16	`lf:8,lp:4,ls:4,rf:3,rp:3,rs:1,re:1,a:3`
[4/5]	abaa	13	`lf:8,lp:5,rf:7,rp:4,rs:1,a:2`
[4/6]	baba	12	`lf:12,rf:8,rs:4,a:2`
[5/0]	ababb	24	`lf:15,lp:5,ls:4,rf:7,rp:5,lsrp:2`
[5/1]	aabba	12	`lf:6,lp:5,ls:1,rf:5,rp:5,rs:1,re:1,a:1`
[5/2]	abbaa	12	`lf:8,ls:4,rf:5,rs:5`
[5/3]	babba	11	`lf:11,rf:7,rs:1`
[5/4]	babab	10	`lf:10,rf:3,a:2`
[5/5]	abaab	9	`lf:5,lp:4,rf:5,rp:3,rs:3,re:1,a:2`
[5/6]	abbab	8	`lf:8,rf:5,a:2`
[6/0]	ababba	16	`lf:11,lp:5,rf:7,rp:5,rs:1,re:1`
[6/1]	babbaa	10	`lf:6,ls:4,rf:4,rs:4`
[6/2]	bababb	10	`lf:8,ls:2,rf:1,a:2`
[6/3]	abbaba	8	`lf:8,rf:5,rs:2,a:2`
[6/4]	aabbab	6	`lf:3,lp:3,rf:3,rp:3,a:3`
[6/5]	bbabab	6	`lf:6,rf:2,a:2`
[6/6]	babbab	5	`lf:5,rf:2,a:2`
[7/0]	ababbaa	12	`lf:6,lp:2,ls:4,rf:4,rp:2,rs:4,re:2,lprs:1`
[7/1]	ababbab	8	`lf:5,lp:3,rf:2,rp:2,a:2`
[7/2]	aabbaba	6	`lf:3,lp:3,rf:3,rp:3,rs:1,re:1,a:3`
[7/3]	abababb	6	`lf:4,ls:2,rf:1,rp:1,a:4`
[7/4]	abbabab	6	`lf:6,rf:2,a:2`
[7/5]	bababba	6	`lf:6,rf:1,a:2`
[7/6]	babbaba	5	`lf:5,rf:2,rs:1,a:2`

Considering [length 6 / frequency 1] babbaa=c.

Step 2

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

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