Morphocompletion for #4297 ⟨a, b | abababaab=ba⟩

Solved by morph:2/0,4/0. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(a) = 1

Rewriting system is not complete: rulesLimit

#	Rule
1.	abababaab ⇒ ba
2.	baababaab ⇒ ababababa
3.	baabababa ⇒ abbaabaab
4.	baabbaaab ⇒ ababbaaba
5.	baabbaaba ⇒ abbabaaab
6.	abbaabaabab ⇒ baba
7.	ababbaaababab ⇒ baabba
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	ab	31	`lf:23,lp:3,ls:5,rf:15,rp:4,rs:2,lsrp:2`
[2/1]	ba	28	`lf:22,lp:4,ls:2,rf:16,rp:3,rs:5,re:1,lprs:2`
[2/2]	aa	13	`lf:13,rf:6`
[2/3]	bb	4	`lf:4,rf:4,a:4`
[3/0]	aba	18	`lf:14,lp:2,ls:2,rf:9,rp:2,rs:3`
[3/1]	baa	15	`lf:11,lp:4,rf:5,rp:1`
[3/2]	aab	14	`lf:11,ls:3,rf:5,rs:2`
[3/3]	bab	11	`lf:9,ls:2,rf:6,rp:1,lsrp:1`
[4/0]	baab	15	`lf:9,lp:4,ls:2,rf:4,rp:1,rs:1,lprs:1`
[4/1]	abab	13	`lf:9,lp:2,ls:2,rf:4,rp:2`
[4/2]	aaba	7	`lf:6,ls:1,rf:2,rs:1,a:1`
[4/3]	baba	7	`lf:6,ls:1,rf:5,rp:1,rs:2,re:1`
[5/0]	baaba	8	`lf:5,lp:2,ls:1,rf:2,rs:1,a:1`
[5/1]	ababa	8	`lf:6,lp:1,ls:1,rf:3,rp:1,rs:1`
[5/2]	abbaa	5	`lf:4,lp:1,rf:2,rp:1,a:4`
[5/3]	abaab	5	`lf:3,ls:2,rf:1,rs:1`
[6/0]	baabab	6	`lf:3,lp:2,ls:1,a:1`
[6/1]	ababab	5	`lf:3,lp:1,ls:1,rf:2,rp:1`
[6/2]	babaab	4	`lf:2,ls:2`
[6/3]	baabba	4	`lf:2,lp:2,rf:1,rp:1,rs:1,re:1,a:12`

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

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ c
2.	cccac ⇒ ba
3.	baaccb ⇒ cacccccc
4.	bacacb ⇒ ccaccccc
5.	bacaccb ⇒ ccacbc
6.	baccac ⇒ cccca
7.	cacaccb ⇒ accacbc
8.	caccac ⇒ acccca
9.	bcacacb ⇒ cbaccc
10.	bcacacc ⇒ ccccca
11.	cbacac ⇒ baccca
12.	cbacca ⇒ bcacac
13.	ccacacc ⇒ accccca
14.	ccacba ⇒ bacacc
15.	ccacccca ⇒ bacac
16.	bccaacb ⇒ cbcacc
17.	cbcaca ⇒ bccaac
18.	ccbaac ⇒ bcacca
19.	bacbaac ⇒ ccbaca
20.	bacbaca ⇒ cbcaac
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ac	36	`lf:30,ls:6,rf:20,rp:3,rs:4,lsrp:1,a:2`
[2/1]	ca	29	`lf:23,lp:2,ls:4,rf:19,rp:1,rs:7,lprs:1,a:2`
[2/2]	cc	25	`lf:18,lp:5,ls:2,rf:35,rp:5,rs:5,lsrp:1,lprs:1,a:2`
[2/3]	cb	22	`lf:13,lp:3,ls:6,rf:6,rp:3,lsrp:2,a:5`
[2/4]	ba	19	`lf:12,lp:6,ls:1,rf:6,rp:4,rs:1,re:1,lsrp:1,a:2`
[2/5]	bc	7	`lf:4,lp:3,rf:7,rp:3,rs:2,a:12`
[2/6]	aa	4	`lf:4,rf:2,a:13`
[3/0]	cac	24	`lf:18,lp:2,ls:4,rf:10,rp:1,rs:2,a:2`
[3/1]	cca	14	`lf:9,lp:3,ls:2,rf:10,rp:2,rs:6,lprs:1,a:2`
[3/2]	bac	13	`lf:8,lp:5,rf:5,rp:3,a:3`
[3/3]	aca	11	`lf:9,ls:2,rf:4,rs:1,a:5`
[3/4]	acc	11	`lf:9,ls:2,rf:10,rp:3,rs:2,lsrp:1,a:3`
[3/5]	cba	9	`lf:6,lp:2,ls:1,rf:2,rp:1,a:5`
[3/6]	acb	9	`lf:6,ls:3,rf:2,a:16`
[4/0]	ccac	12	`lf:6,lp:3,ls:3,rf:3,rp:2,a:2`
[4/1]	cacc	9	`lf:6,lp:1,ls:2,rf:5,rp:1,rs:2,a:4`
[4/2]	acac	8	`lf:7,ls:1,rf:3,rs:2,a:5`
[4/3]	caca	7	`lf:5,lp:1,ls:1,rf:1,a:12`
[4/4]	baca	7	`lf:4,lp:2,ls:1,rf:3,rp:2,rs:1,a:5`
[4/5]	baac	6	`lf:3,lp:1,ls:2,a:13`
[4/6]	accb	6	`lf:3,ls:3,a:42`
[5/0]	bcaca	6	`lf:3,lp:2,ls:1,rf:1,rp:1,a:12`
[5/1]	bacac	6	`lf:3,lp:2,ls:1,rf:2,rp:2,rs:1,re:1,a:5`
[5/2]	acacc	6	`lf:4,ls:2,rf:1,rs:1,a:20`
[5/3]	cacac	5	`lf:4,lp:1,rf:1,rs:1,a:12`
[5/4]	cbaca	4	`lf:2,lp:1,ls:1,rf:1,rs:1,a:5`
[5/5]	cbaac	4	`lf:2,ls:2,a:13`
[5/6]	bacca	4	`lf:2,lp:1,ls:1,a:3`

Considering [length 4 / frequency 0] ccac=d.

Step 3

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

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