Morphocompletion for #3814 ⟨a, b | abbababaab=a⟩

Solved by morph:6/1,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: rulesLimit

#	Rule
1.	aaabbbab ⇒ abbababa
2.	aabaabb ⇒ aaabbba
3.	aababaab ⇒ abababaa
4.	abababaab ⇒ abbababaa
5.	abbababaab ⇒ a
6.	aaabbaabb ⇒ aaababbba
7.	aaabbbbababaa ⇒ aaab
8.	aaabbbbbababaa ⇒ aaabb
9.	abbabababbababa ⇒ aaabbb
10.	abbabababababaa ⇒ aabaab
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	ab	43	`lf:35,lp:4,ls:4,rf:17,rp:3,rs:2,lprp:1,lsrp:3,lprs:1`
[2/1]	ba	30	`lf:29,ls:1,rf:13,rs:3`
[2/2]	aa	27	`lf:18,lp:6,ls:3,rf:14,rp:6,rs:2,lprp:4,lsrp:3,lprs:1`
[2/3]	bb	18	`lf:16,ls:2,rf:9,rs:2`
[3/0]	aba	23	`lf:21,lp:1,ls:1,rf:9,rp:1,rs:1`
[3/1]	bab	21	`lf:20,ls:1,rf:7`
[3/2]	aab	16	`lf:11,lp:2,ls:3,rf:7,rp:1,rs:2`
[3/3]	abb	15	`lf:10,lp:3,ls:2,rf:6,rp:2,rs:1`
[4/0]	baba	19	`lf:18,ls:1,rf:6,rs:1`
[4/1]	abab	14	`lf:13,lp:1,rf:5,rp:1`
[4/2]	abaa	10	`lf:7,ls:3,rf:3,rs:2`
[4/3]	aaab	8	`lf:4,lp:4,rf:5,rp:5,rs:1,re:1,lprp:3,lprs:1,a:10`
[5/0]	ababa	14	`lf:12,lp:1,ls:1,rf:4,rp:1,rs:1`
[5/1]	babab	11	`lf:11,rf:3`
[5/2]	babaa	9	`lf:6,ls:3,rf:2,rs:2`
[5/3]	aaabb	8	`lf:4,lp:4,rf:3,rp:3,rs:1,re:1,lprp:1,lprs:1,a:10`
[6/0]	bababa	11	`lf:10,ls:1,rf:3,rs:1`
[6/1]	ababaa	9	`lf:6,ls:3,rf:2,rs:2`
[6/2]	abbaba	7	`lf:4,lp:3,rf:2,rp:2`
[6/3]	aaabbb	6	`lf:3,lp:3,rf:2,rp:2,rs:1,re:1,a:10`

Considering [length 6 / frequency 1] ababaa=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ccb ⇒ cbc
2.	cbcb ⇒ cbbc
3.	cbbcb ⇒ c
4.	acb ⇒ abc
5.	abcb ⇒ abbc
6.	abbcb ⇒ a
7.	cbabaa ⇒ ababac
8.	ababaa ⇒ c
9.	cbbababac ⇒ cabaa
10.	cbbabababc ⇒ cabaab
11.	abbababac ⇒ aabaa
12.	abbabababc ⇒ aabaab
13.	cbcabaa ⇒ cababac
14.	cbbcabaa ⇒ cbababac
15.	abcabaa ⇒ aababac
16.	abbcabaa ⇒ abababac
17.	cbbcababac ⇒ ccabaa
18.	abbcababac ⇒ acabaa
19.	cbccabaa ⇒ ccababac
20.	abccabaa ⇒ acababac
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ab	40	`lf:31,lp:9,rf:25,rp:4,rs:2,lprp:2,lprs:1,a:1`
[2/1]	cb	30	`lf:15,lp:9,ls:6,rf:3,rp:3,lprp:2,lsrp:11,a:2`
[2/2]	ba	26	`lf:26,rf:22,a:1`
[2/3]	aa	16	`lf:8,ls:8,rf:9,rp:3,rs:4,lsrp:1,a:1`
[2/4]	bc	16	`lf:14,ls:2,rf:4,rs:4,a:2`
[2/5]	ac	10	`lf:5,lp:1,ls:4,rf:9,rp:2,rs:7,lsrp:1,a:3`
[2/6]	bb	10	`lf:10,rf:2,a:2`
[3/0]	aba	22	`lf:21,lp:1,rf:21,rp:2,a:1`
[3/1]	baa	16	`lf:8,ls:8,rf:6,rs:4,a:1`
[3/2]	bab	14	`lf:14,rf:9,a:1`
[3/3]	abc	10	`lf:5,lp:3,ls:2,rf:1,rp:1,rs:1,re:1,a:5`
[3/4]	abb	10	`lf:5,lp:5,rf:1,rp:1,a:2`
[3/5]	cbb	10	`lf:5,lp:5,rf:1,rp:1,a:4`
[3/6]	cab	8	`lf:8,rf:7,rp:3,a:11`
[4/0]	abaa	16	`lf:8,ls:8,rf:6,rs:4,a:1`
[4/1]	baba	12	`lf:12,rf:9,a:1`
[4/2]	abab	10	`lf:9,lp:1,rf:8,rp:2,a:1`
[4/3]	caba	8	`lf:8,rf:7,rp:3,a:11`
[4/4]	abac	8	`lf:4,ls:4,rf:7,rs:7,a:3`
[4/5]	bcab	6	`lf:6,a:12`
[4/6]	abbc	6	`lf:3,lp:3,rf:1,rp:1,rs:1,re:1,a:2`
[5/0]	cabaa	12	`lf:6,ls:6,rf:4,rp:2,rs:3,re:1,a:11`
[5/1]	ababa	8	`lf:7,lp:1,rf:8,rp:2,a:1`
[5/2]	babac	8	`lf:4,ls:4,rf:7,rs:7,a:3`
[5/3]	bcaba	6	`lf:6,a:12`
[5/4]	babab	6	`lf:6,rf:2,a:9`
[5/5]	babaa	4	`lf:2,ls:2,a:1`
[5/6]	abbca	4	`lf:2,lp:2,a:12`

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

Step 3

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

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