Morphocompletion for #4289 ⟨a, b | ababaabab=ba⟩

Solved by morph:5/0,2/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: rulesLimit

#	Rule
1.	abababa ⇒ baaabab
2.	ababaabab ⇒ ba
3.	baaababba ⇒ abbaaabab
4.	ababaabba ⇒ baabaabab
5.	baaabbaaba ⇒ abbaaaabab
6.	baabaaababb ⇒ abba
7.	baaabbaaabab ⇒ abbaa
8.	baaabababba ⇒ abbaabaabab
9.	ababaabaabba ⇒ baaabaaababb
10.	baaabbaaabba ⇒ abbaaabaabab
11.	ababaabaababba ⇒ baaaababbaabab
12.	abbaaaababbaba ⇒ baaabbabaaabab
13.	abbaaaababbaabab ⇒ baaabbaba
14.	baabaababbabaabab ⇒ ababaabbba
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	ba	67	`lf:51,lp:7,ls:9,rf:35,rp:7,rs:4,re:1,lsrp:5,lprs:2`
[2/1]	ab	60	`lf:49,lp:7,ls:4,rf:37,rp:7,rs:8,lsrp:2,lprs:4`
[2/2]	aa	34	`lf:34,rf:30,rs:1`
[2/3]	bb	16	`lf:15,ls:1,rf:12,rs:1,a:2`
[3/0]	aba	38	`lf:30,lp:5,ls:3,rf:18,rp:1,rs:1`
[3/1]	baa	29	`lf:22,lp:7,rf:18,rp:6,rs:1,lprs:1`
[3/2]	bab	24	`lf:20,ls:4,rf:13,rs:8`
[3/3]	aab	22	`lf:22,rf:17`
[4/0]	abab	27	`lf:18,lp:5,ls:4,rf:11,rp:1,rs:8,lsrp:1,lprs:3`
[4/1]	abba	22	`lf:14,lp:2,ls:6,rf:9,rp:6,rs:1,re:1,lsrp:3,a:2`
[4/2]	aaba	17	`lf:16,ls:1,rf:14`
[4/3]	baaa	15	`lf:10,lp:5,rf:10,rp:5,a:1`
[5/0]	aabab	15	`lf:11,ls:4,rf:10,rs:8`
[5/1]	baaba	13	`lf:10,lp:2,ls:1,rf:6,rp:1`
[5/2]	ababa	13	`lf:7,lp:5,ls:1,rf:1,rp:1`
[5/3]	baaab	13	`lf:8,lp:5,rf:8,rp:4,a:1`
[6/0]	ababba	9	`lf:6,ls:3,rf:1,a:4`
[6/1]	baabab	8	`lf:5,ls:3,rf:4,rs:4`
[6/2]	ababaa	8	`lf:4,lp:4,rf:1,rp:1`
[6/3]	baaabb	7	`lf:4,lp:3,rf:2,rp:2,a:7`

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

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	accb ⇒ c
2.	aba ⇒ cc
3.	abc ⇒ ccccb
4.	ccbc ⇒ ba
5.	abca ⇒ ccccba
6.	abcc ⇒ ccba
7.	aabba ⇒ cabc
8.	ccabba ⇒ ccbacccb
9.	accccbba ⇒ cacbc
10.	aabbc ⇒ cccbacb
11.	accabbc ⇒ cacbacb
12.	ccbabc ⇒ abba
13.	bacbc ⇒ ccbba
14.	abbaa ⇒ bacccba
15.	abbac ⇒ bacba
16.	bacbacb ⇒ abbc
17.	bacccbba ⇒ abbcc
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	ba	20	`lf:12,lp:3,ls:5,rf:12,rp:3,rs:7,re:1,lprs:1,a:3`
[2/1]	ab	17	`lf:11,lp:6,rf:4,rp:3,a:3`
[2/2]	cc	15	`lf:11,lp:3,ls:1,rf:17,rp:7,rs:2,re:1,lprp:1,lsrp:1,a:3`
[2/3]	bc	14	`lf:8,ls:6,rf:4,rs:3,a:4`
[2/4]	ac	12	`lf:8,lp:3,ls:1,rf:7,a:8`
[2/5]	cb	10	`lf:8,ls:2,rf:13,rs:4,a:6`
[2/6]	bb	8	`lf:8,rf:4,a:4`
[3/0]	bba	10	`lf:6,ls:4,rf:2,rs:2,a:4`
[3/1]	bac	9	`lf:5,lp:3,ls:1,rf:5,rp:2,lsrp:1,a:8`
[3/2]	abb	8	`lf:6,lp:2,rf:3,rp:3,a:4`
[3/3]	ccb	8	`lf:5,lp:2,ls:1,rf:8,rp:3,rs:2,a:6`
[3/4]	acc	7	`lf:4,lp:3,rf:2,a:21`
[3/5]	abc	6	`lf:3,lp:2,ls:1,rf:1,rs:1,a:4`
[3/6]	bbc	4	`lf:2,ls:2,rf:2,rs:1,a:26`
[4/0]	abba	8	`lf:4,lp:2,ls:2,rf:1,rp:1,rs:1,re:1,a:4`
[4/1]	bacb	6	`lf:3,lp:2,ls:1,rf:3,rp:1,rs:2,a:8`
[4/2]	abbc	4	`lf:2,ls:2,rf:2,rp:2,rs:1,re:1,a:26`
[4/3]	cbba	4	`lf:2,ls:2,rf:1,rs:1,a:8`
[4/4]	aabb	4	`lf:2,lp:2,a:4`
[4/5]	ccab	3	`lf:2,lp:1,a:27`
[4/6]	accc	3	`lf:2,lp:1,rf:2,a:21`
[5/0]	ccbba	4	`lf:2,ls:2,rf:1,rp:1,rs:1,re:1,a:8`
[5/1]	ccabb	3	`lf:2,lp:1,a:27`
[5/2]	cbabc	2	`lf:1,ls:1,a:10`
[5/3]	cabbc	2	`lf:1,ls:1,a:30`
[5/4]	bacba	2	`lf:1,lp:1,rf:1,rp:1,rs:1,re:1,a:20`
[5/5]	cabba	2	`lf:1,ls:1,a:27`
[5/6]	cbacb	2	`lf:1,ls:1,rf:2,rs:2,a:26`

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

Step 3

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

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