Morphocompletion for #4308 ⟨a, b | ababbaaab=ba⟩

Solved by morph:6/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.	ababbaaab ⇒ ba
2.	ababbaaba ⇒ baabbaaab
3.	baabbaaabbbaaab ⇒ ababbaba
4.	ababbaaaababbaba ⇒ baaabbaaabbbaaab
5.	baabbaaabbbaaba ⇒ ababbabaabbaaab
6.	baabbaaabbabbaaab ⇒ ababbaabba
7.	ababbaaaababbaabba ⇒ baaabbaaabbabbaaab
8.	baabbaaabbabbaaba ⇒ ababbaabbaabbaaab
9.	ababababbaaaababbba ⇒ babaaabbbaaabbbaaab
10.	baaabbaaabbbaaabbbaaab ⇒ ababbaaaababbba
11.	baaabbaaabbbaaabbabbaaab ⇒ ababbaaaababbabba
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	ba	58	`lf:46,lp:6,ls:6,rf:37,rp:5,rs:5,re:1,lsrp:4,lprs:4`
[2/1]	ab	55	`lf:45,lp:5,ls:5,rf:38,rp:6,rs:6,lsrp:4,lprs:4`
[2/2]	aa	47	`lf:47,rf:35`
[2/3]	bb	32	`lf:32,rf:25`
[3/0]	baa	32	`lf:26,lp:6,rf:19,rp:3`
[3/1]	aab	31	`lf:26,ls:5,rf:19,rs:6`
[3/2]	bba	28	`lf:26,ls:2,rf:21,rs:3`
[3/3]	abb	26	`lf:26,rf:21`
[3/4]	aba	23	`lf:14,lp:5,ls:4,rf:11,rp:6,rs:1,lsrp:2`
[3/5]	aaa	21	`lf:21,rf:16`
[3/6]	bab	14	`lf:14,rf:13,rp:1`
[4/0]	aaab	23	`lf:18,ls:5,rf:14,rs:6`
[4/1]	abba	21	`lf:20,ls:1,rf:17,rs:2`
[4/2]	bbaa	20	`lf:20,rf:14`
[4/3]	baaa	20	`lf:18,lp:2,rf:14,rp:2`
[4/4]	abab	15	`lf:10,lp:5,rf:8,rp:6`
[4/5]	aabb	15	`lf:15,rf:11,a:1`
[4/6]	baab	12	`lf:8,lp:4,rf:5,rp:1,a:1`
[5/0]	baaab	22	`lf:15,lp:2,ls:5,rf:12,rp:2,rs:6`
[5/1]	bbaaa	16	`lf:16,rf:11`
[5/2]	abbaa	15	`lf:15,rf:11`
[5/3]	ababb	12	`lf:8,lp:4,rf:8,rp:6`
[5/4]	aabba	11	`lf:10,ls:1,rf:8,rs:1,a:1`
[5/5]	babba	10	`lf:10,rf:9,rs:1`
[5/6]	aaabb	10	`lf:10,rf:6,a:2`
[6/0]	bbaaab	18	`lf:13,ls:5,rf:9,rs:6`
[6/1]	baaabb	12	`lf:10,lp:2,rf:6,rp:2,a:2`
[6/2]	abbaaa	12	`lf:12,rf:8`
[6/3]	ababba	11	`lf:7,lp:4,rf:7,rp:6`
[6/4]	baabba	10	`lf:5,lp:4,ls:1,rf:5,rp:1,rs:1,lprs:1,a:1`
[6/5]	babbaa	9	`lf:9,rf:5`
[6/6]	bbaaba	6	`lf:3,ls:3,a:1`
[7/0]	abbaaab	12	`lf:9,ls:3,rf:6,rs:4`
[7/1]	ababbaa	10	`lf:6,lp:4,rf:4,rp:4`
[7/2]	bbaaabb	8	`lf:8,rf:3,a:2`
[7/3]	baabbaa	8	`lf:4,lp:4,rf:4,rp:1,a:1`
[7/4]	baaabba	7	`lf:5,lp:2,rf:3,rp:2,a:3`
[7/5]	bbbaaab	6	`lf:4,ls:2,rf:3,rs:2,a:2`
[7/6]	babbaaa	6	`lf:6,rf:3`

Considering [length 6 / frequency 0] bbaaab=c.

Step 2

Auxiliary generators:
1. c = bbaaab
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 | ababbaaab=ba⟩.