Morphocompletion for #3535 ⟨a, b | aabaaaaaba=a⟩

Solved by morph:5/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: roundsLimit

#	Rule
1.	abaaaa ⇒ aaaaba
2.	aaaaabaaba ⇒ a
3.	abaabaa ⇒ aabaaba
4.	aaaaaaababaaba ⇒ abaaa
5.	aaaabaaabaaba ⇒ abaa
6.	aabaababaa ⇒ abaaabaaba
7.	abaababaaa ⇒ aaababaaba
8.	aaaaaaabababaaba ⇒ ababaaa
9.	aaaaaaabaaababaaba ⇒ abaaabaaa
10.	aaaababaaabaaba ⇒ ababaa
11.	aaaabaaabaaabaaba ⇒ abaaabaa
12.	aabaabababaa ⇒ ababaaabaaba
13.	aaaabababaaabaaba ⇒ abababaa
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	aa	83	`lf:68,lp:10,ls:5,rf:28,rp:3,rs:7,lsrp:3,lprs:7,a:2`
[2/1]	ba	50	`lf:42,ls:8,rf:26,rs:5,a:2`
[2/2]	ab	45	`lf:42,lp:3,rf:26,rp:9,a:2`
[3/0]	aba	53	`lf:42,lp:3,ls:8,rf:26,rp:9,rs:5,lsrp:7,lprs:3,a:2`
[3/1]	aaa	45	`lf:35,lp:8,ls:2,rf:10,rp:2,rs:3,lsrp:2,lprs:3,a:2`
[3/2]	aab	30	`lf:28,lp:2,rf:11,rp:1,a:2`
[3/3]	baa	26	`lf:23,ls:3,rf:15,rs:4,a:2`
[3/4]	bab	11	`lf:11,rf:6,a:15`
[4/0]	aaba	38	`lf:28,lp:2,ls:8,rf:11,rp:1,rs:5,lprs:2,a:2`
[4/1]	abaa	29	`lf:23,lp:3,ls:3,rf:15,rp:5,rs:4,re:1,lsrp:1,a:2`
[4/2]	aaaa	28	`lf:19,lp:8,ls:1,rf:1,rp:1,lsrp:1,a:2`
[4/3]	aaab	14	`lf:14,rf:6,rp:1,a:2`
[4/4]	baab	12	`lf:12,rf:4,a:2`
[4/5]	baba	11	`lf:11,rf:6,a:15`
[4/6]	abab	11	`lf:11,rf:6,rp:4,a:15`
[5/0]	baaba	20	`lf:12,ls:8,rf:4,rs:4,a:2`
[5/1]	aabaa	15	`lf:12,lp:2,ls:1,rf:5,rp:1,rs:1,lsrp:1,a:2`
[5/2]	abaab	14	`lf:12,lp:2,rf:4,a:2`
[5/3]	aaaba	14	`lf:14,rf:6,rp:1,rs:1,a:2`
[5/4]	aaaaa	14	`lf:10,lp:4,a:2`
[5/5]	aaaab	12	`lf:8,lp:4,rf:1,rp:1,a:2`
[5/6]	ababa	11	`lf:11,rf:6,rp:4,a:15`
[6/0]	abaaba	22	`lf:12,lp:2,ls:8,rf:4,rs:4,lprs:11,a:2`
[6/1]	aaaaba	12	`lf:8,lp:4,rf:1,rp:1,rs:1,re:1,a:2`
[6/2]	ababaa	10	`lf:8,ls:2,rf:5,rp:3,rs:2,re:1,lsrp:1,a:15`
[6/3]	aabaab	9	`lf:7,lp:2,rf:3,rp:1,a:2`
[6/4]	aaabaa	9	`lf:9,rf:4,rs:1,a:2`
[6/5]	aaaaaa	9	`lf:6,lp:3,a:20`
[6/6]	aababa	8	`lf:8,rf:1,a:15`
[7/0]	aabaaba	14	`lf:7,lp:2,ls:5,rf:3,rp:1,rs:3,re:1,lprs:2,a:2`
[7/1]	babaaba	6	`lf:3,ls:3,rf:1,rs:1,a:20`
[7/2]	aababaa	6	`lf:5,ls:1,rf:1,a:15`
[7/3]	abaaaba	6	`lf:6,rf:4,rp:3,a:15`
[7/4]	aaaabab	6	`lf:4,lp:2,a:20`
[7/5]	aaaabaa	6	`lf:4,lp:2,a:2`
[7/6]	aaaaaaa	6	`lf:3,lp:3,a:20`

Considering [length 5 / frequency 0] baaba=c.

Step 2

Auxiliary generators:
1. c = baaba
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 | aabaaaaaba=a⟩.