Morphocompletion for #4780 ⟨a, b | abaaabba=bab⟩

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(a) = 0; deg(b) = 1

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abaaabba ⇒ bab
2.	babbaaabba ⇒ abaaabbbab
3.	abaaababaaabbbab ⇒ babbbaaabba
4.	babbbaaabbaaaabba ⇒ abaaababaaabbbbab
5.	abaaabbbabbbaaabba ⇒ babbaaababaaabbbab
6.	abaaababaaababaaabbbbab ⇒ babbbbaaabbaaaabba
7.	abaaababaaabbbaabaaabbbab ⇒ babbbaaabbaabbaaabba
8.	abaaabbbabbaaababaaabbbab ⇒ babbaaabbbabbbaaabba
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	ab	47	`lf:37,lp:6,ls:4,rf:27,rp:2,rs:4,lprs:2`
[2/1]	ba	41	`lf:35,lp:2,ls:4,rf:29,rp:6,rs:4,lsrp:2`
[2/2]	aa	36	`lf:36,rf:26`
[2/3]	bb	26	`lf:26,rf:27`
[3/0]	aba	23	`lf:17,lp:6,rf:6,rp:2`
[3/1]	bba	20	`lf:16,ls:4,rf:17,rs:4`
[3/2]	bab	19	`lf:13,lp:2,ls:4,rf:12,rp:6,rs:4,re:1,lsrp:4,lprs:2`
[3/3]	baa	18	`lf:18,rf:13`
[3/4]	aab	18	`lf:18,rf:13`
[3/5]	aaa	18	`lf:18,rf:13`
[3/6]	abb	16	`lf:16,rf:17`
[4/0]	abaa	18	`lf:12,lp:6,rf:4,rp:2`
[4/1]	baaa	17	`lf:17,rf:12`
[4/2]	aaab	17	`lf:17,rf:12`
[4/3]	aabb	12	`lf:12,rf:11`
[4/4]	abba	11	`lf:7,ls:4,rf:9,rs:4`
[4/5]	bbab	10	`lf:6,ls:4,rf:4,rs:3,a:1`
[4/6]	bbba	9	`lf:9,rf:8,a:1`
[5/0]	abaaa	18	`lf:12,lp:6,rf:4,rp:2`
[5/1]	baaab	16	`lf:16,rf:11`
[5/2]	aaabb	12	`lf:12,rf:10`
[5/3]	bbbab	10	`lf:6,ls:4,rf:4,rs:3,a:1`
[5/4]	aabba	9	`lf:5,ls:4,rf:7,rs:4`
[5/5]	abbba	8	`lf:8,rf:6,a:1`
[5/6]	aabbb	7	`lf:7,rf:4,a:1`
[6/0]	abaaab	18	`lf:12,lp:6,rf:4,rp:2`
[6/1]	baaabb	11	`lf:11,rf:9`
[6/2]	aaabba	9	`lf:5,ls:4,rf:6,rs:4`
[6/3]	abbbab	8	`lf:5,ls:3,rf:3,rs:2,a:1`
[6/4]	aaabbb	7	`lf:7,rf:4,a:1`
[6/5]	aabbba	6	`lf:6,rf:3,a:1`
[6/6]	babaaa	5	`lf:5,rf:2,a:2`
[7/0]	abaaabb	11	`lf:8,lp:3,rf:3,rp:1`
[7/1]	aabbbab	8	`lf:5,ls:3,rf:3,rs:2,a:1`
[7/2]	baaabbb	7	`lf:7,rf:4,a:1`
[7/3]	baaabba	7	`lf:4,ls:3,rf:5,rs:3`
[7/4]	abaaaba	7	`lf:4,lp:3,rf:1,rp:1,a:2`
[7/5]	aaabbba	6	`lf:6,rf:3,a:1`
[7/6]	babaaab	5	`lf:5,rf:2,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(c) = deg(a) = 0, c < a; deg(b) = 1

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