Morphocompletion for #4808 ⟨a, b | abaabbba=bab⟩

Solved by morph:5/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.	abaabbba ⇒ bab
2.	abaabbbbab ⇒ babbaabbba
3.	babbaabbbaaabbba ⇒ abaabbbbbab
4.	abaabbabaabbbbbab ⇒ babbbaabbbaaabbba
5.	abaabbbbbabbaabbba ⇒ babbaabbbaaabbbbab
6.	babbbaabbbaaabbbaaabbba ⇒ abaabbabaabbbbbbab
7.	babbaabbbaabbaabbbaaabbba ⇒ abaabbbbaabaabbbbbab
8.	babbaabbbaaabbbbabbaabbba ⇒ abaabbbbbabbaabbbbab
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	bb	47	`lf:47,rf:40`
[2/1]	ba	43	`lf:33,lp:4,ls:6,rf:26,rp:4,rs:2,lsrp:2`
[2/2]	ab	37	`lf:31,lp:4,ls:2,rf:28,rp:4,rs:6,lprs:2`
[2/3]	aa	23	`lf:23,rf:15`
[3/0]	bba	30	`lf:24,ls:6,rf:16,rs:2`
[3/1]	abb	24	`lf:24,rf:16`
[3/2]	bbb	23	`lf:23,rf:24`
[3/3]	aab	18	`lf:18,rf:13`
[3/4]	baa	18	`lf:18,rf:13`
[3/5]	bab	15	`lf:9,lp:4,ls:2,rf:11,rp:4,rs:6,re:1,lsrp:2,lprs:4`
[3/6]	aba	9	`lf:5,lp:4,rf:6,rp:4`
[4/0]	bbba	23	`lf:17,ls:6,rf:12,rs:2`
[4/1]	aabb	18	`lf:18,rf:12`
[4/2]	abbb	17	`lf:17,rf:12`
[4/3]	baab	13	`lf:13,rf:11`
[4/4]	bbaa	13	`lf:13,rf:7,a:1`
[4/5]	babb	10	`lf:6,lp:4,rf:4,rp:3,a:1`
[4/6]	abaa	9	`lf:5,lp:4,rf:6,rp:4`
[5/0]	abbba	19	`lf:13,ls:6,rf:5,rs:2`
[5/1]	aabbb	16	`lf:16,rf:11`
[5/2]	baabb	13	`lf:13,rf:10`
[5/3]	abaab	9	`lf:5,lp:4,rf:6,rp:4`
[5/4]	babba	8	`lf:5,lp:3,rf:3,rp:2,a:1`
[5/5]	bbaab	8	`lf:8,rf:5,a:1`
[5/6]	bbbaa	7	`lf:7,rf:4,a:2`
[6/0]	aabbba	18	`lf:12,ls:6,rf:4,rs:2`
[6/1]	baabbb	11	`lf:11,rf:9`
[6/2]	abaabb	9	`lf:5,lp:4,rf:6,rp:4`
[6/3]	bbaabb	8	`lf:8,rf:4,a:1`
[6/4]	babbaa	8	`lf:5,lp:3,rf:3,rp:2,a:1`
[6/5]	abbbaa	7	`lf:7,rf:3,a:2`
[6/6]	bbbbab	6	`lf:4,ls:2,rf:6,rs:5,a:1`
[7/0]	baabbba	11	`lf:8,ls:3,rf:3,rs:1`
[7/1]	babbaab	8	`lf:5,lp:3,rf:3,rp:2,a:1`
[7/2]	bbaabbb	7	`lf:7,rf:4,a:1`
[7/3]	abaabbb	7	`lf:4,lp:3,rf:5,rp:3`
[7/4]	aaabbba	7	`lf:4,ls:3,rf:1,rs:1,a:2`
[7/5]	abbaabb	6	`lf:6,rf:3,a:1`
[7/6]	aabbbaa	6	`lf:6,rf:2,a:2`

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

Step 2

Auxiliary generators:
1. c = abbba
Reduction order:
- Left-to-right recursive path with deg(c) = deg(a) = 0, c < a; deg(b) = 1

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