Morphocompletion for #4208 ⟨a, b | aabbbbaab=ba⟩

Solved by morph:4/0,2/0. (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: arenaTotalLimit

#	Rule
1.	babbbaab ⇒ aabbbbba
2.	aabbbbaab ⇒ ba
3.	aabbbbbaabbbaab ⇒ babbbaaaabbbbba
4.	aabbbbaaaabbbbba ⇒ baabbbaab
5.	aabbbbbabbbbaabbbaab ⇒ babbbbabbbaaaabbbbba
6.	baabbbaababbbbaab ⇒ aabbbbaaaabbbbbba
7.	aabbbbbabbbaaaabbbbba ⇒ babbbbaabbbaab
8.	aabbbbbabbaababbbbaab ⇒ babbaabbbbaaaabbbbbba
9.	aabbbaabbbbaaaabbbbbba ⇒ babbaababbbbaab
10.	aabbbbaaaabbbbaaaabbbbbba ⇒ baaabbbaababbbbaab
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	bb	71	`lf:71,rf:52`
[2/1]	aa	43	`lf:35,lp:8,rf:25,rp:2`
[2/2]	ab	37	`lf:31,ls:6,rf:24,rs:4`
[2/3]	ba	33	`lf:27,lp:2,ls:4,rf:28,rp:8,rs:6,re:1,lsrp:4,lprs:2`
[3/0]	bbb	48	`lf:48,rf:34`
[3/1]	aab	39	`lf:25,lp:8,ls:6,rf:16,rp:2,rs:4,lsrp:2,lprs:4`
[3/2]	bba	27	`lf:23,ls:4,rf:18,rs:5`
[3/3]	abb	23	`lf:23,rf:18`
[4/0]	bbba	26	`lf:22,ls:4,rf:16,rs:5`
[4/1]	bbbb	26	`lf:26,rf:18`
[4/2]	aabb	25	`lf:17,lp:8,rf:10,rp:2`
[4/3]	abbb	22	`lf:22,rf:16`
[5/0]	aabbb	25	`lf:17,lp:8,rf:10,rp:2`
[5/1]	bbbba	20	`lf:16,ls:4,rf:11,rs:5`
[5/2]	bbaab	17	`lf:11,ls:6,rf:8,rs:4`
[5/3]	abbbb	16	`lf:16,rf:11`
[6/0]	aabbbb	20	`lf:13,lp:7,rf:7,rp:2`
[6/1]	bbbaab	16	`lf:10,ls:6,rf:6,rs:4`
[6/2]	bbbbba	12	`lf:8,ls:4,rf:5,rs:5,a:1`
[6/3]	bbbbaa	9	`lf:9,rf:5`

Considering [length 4 / frequency 0] bbba=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	bbba ⇒ c
2.	cabbc ⇒ bccab
3.	cabcac ⇒ bcbba
4.	cabcab ⇒ bc
5.	aabbc ⇒ bacab
6.	bccababbc ⇒ cabbbccab
7.	aabcac ⇒ babba
8.	ccababcac ⇒ bbaabbbcbba
9.	bbaabbbccac ⇒ ccababbcbba
10.	aabcab ⇒ ba
11.	ccababcab ⇒ bbaabbbc
12.	ccababbccab ⇒ bbaabbbcbc
13.	bbaabbbccab ⇒ ccababbc
14.	bbaabbbcbccab ⇒ ccababbcbc
15.	bacababbc ⇒ aabbbccab
16.	bacababcac ⇒ aabbbcbba
17.	bacababcab ⇒ aabbbc
18.	cabcaaabbbc ⇒ bcacababcab
19.	aabcaaabbbc ⇒ baacababcab
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ab	41	`lf:34,ls:7,rf:24,rs:6,a:2`
[2/1]	ca	29	`lf:25,lp:4,rf:13,rp:1,a:2`
[2/2]	bc	29	`lf:22,lp:1,ls:6,rf:18,rp:4,rs:6,re:1,lsrp:2,a:2`
[2/3]	bb	24	`lf:20,lp:4,rf:25,rp:3,a:1`
[2/4]	ba	18	`lf:14,lp:3,ls:1,rf:17,rp:4,rs:6,re:1,lprs:1,a:1`
[2/5]	aa	15	`lf:11,lp:4,rf:7,rp:3,a:2`
[2/6]	ac	13	`lf:8,ls:5,rf:3,a:4`
[3/0]	cab	29	`lf:18,lp:4,ls:7,rf:12,rp:1,rs:6,lprs:2,a:2`
[3/1]	bbc	16	`lf:10,ls:6,rf:10,rs:3,a:5`
[3/2]	aab	13	`lf:9,lp:4,rf:6,rp:3,a:2`
[3/3]	cca	11	`lf:8,lp:3,rf:6,rp:3,a:7`
[3/4]	abb	10	`lf:10,rf:11,a:4`
[3/5]	abc	10	`lf:10,rf:2,a:2`
[3/6]	cac	10	`lf:5,ls:5,rf:1,a:4`
[4/0]	ccab	13	`lf:7,lp:3,ls:3,rf:6,rp:3,rs:3,lsrp:2,a:7`
[4/1]	abca	10	`lf:10,rf:2,a:2`
[4/2]	abbc	9	`lf:5,ls:4,rf:3,rs:1,a:5`
[4/3]	bcab	8	`lf:4,ls:4,rf:2,rs:2,a:2`
[4/4]	bcac	8	`lf:4,ls:4,rf:1,rp:1,a:4`
[4/5]	aabb	7	`lf:6,lp:1,rf:6,rp:3,a:5`
[4/6]	abab	7	`lf:7,rf:5,a:9`
[5/0]	abcab	8	`lf:4,ls:4,rf:2,rs:2,a:2`
[5/1]	abcac	8	`lf:4,ls:4,a:4`
[5/2]	bccab	8	`lf:4,lp:1,ls:3,rf:3,rp:1,rs:3,re:1,lprs:1,a:7`
[5/3]	cabab	7	`lf:7,rf:5,a:9`
[5/4]	ccaba	7	`lf:4,lp:3,rf:3,rp:3,a:9`
[5/5]	abbbc	7	`lf:5,ls:2,rf:7,rs:2,a:9`
[5/6]	aabca	6	`lf:3,lp:3,a:2`

Considering [length 2 / frequency 0] ab=d.

Step 3

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

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