Morphocompletion for #2624 ⟨a, b | abbaab=bbaa⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: rulesLimit

#	Rule
1.	abbaab ⇒ bbaa
2.	abbabbaa ⇒ bbaabaab
3.	aabbbbaa ⇒ bbaaaabb
4.	bbaabaabb ⇒ abbbbaa
5.	abbbbaaaab ⇒ bbaababbaa
6.	abbbbaaabbaa ⇒ bbaabbbaaaab
7.	aabbbbbbaaaa ⇒ bbbbaaaaaabb
8.	aaabbbbabbaa ⇒ bbaabaaaabbb
9.	bbaabbbaaaabb ⇒ abbbbaabbaa
10.	bbaabbaaaabbb ⇒ aabbbbabbaa
	...

Collecting factors up to length 7 / frequency 4:

[2/0]	bb	38	`lf:32,lp:3,ls:3,rf:27,rp:7,rs:3`
[2/1]	aa	35	`lf:27,lp:3,ls:5,rf:26,rp:1,rs:5`
[2/2]	ab	24	`lf:18,lp:4,ls:2,rf:15,rp:2,rs:2,lprs:2`
[2/3]	ba	16	`lf:16,rf:17`
[3/0]	abb	21	`lf:15,lp:4,ls:2,rf:10,rp:2,rs:2,lsrp:2`
[3/1]	bba	18	`lf:15,lp:3,rf:14,rp:6`
[3/2]	baa	18	`lf:14,ls:4,rf:15,rs:5`
[3/3]	aab	16	`lf:12,lp:2,ls:2,rf:11,rp:1,rs:2`
[4/0]	bbaa	20	`lf:13,lp:3,ls:4,rf:13,rp:6,rs:5,re:1,lsrp:4,lprs:3`
[4/1]	aabb	13	`lf:9,lp:2,ls:2,rf:6,rp:1,rs:2,lprs:2,a:2`
[4/2]	abbb	10	`lf:7,lp:2,ls:1,rf:5,rp:2,rs:1,a:2`
[4/3]	abba	8	`lf:6,lp:2,rf:3`
[5/0]	abbaa	9	`lf:5,lp:1,ls:3,rf:3,rs:3`
[5/1]	aabbb	8	`lf:5,lp:2,ls:1,rf:3,rp:1,rs:1,lsrp:1,a:3`
[5/2]	bbaab	8	`lf:4,lp:3,ls:1,rf:5,rp:4`
[5/3]	abbbb	7	`lf:5,lp:2,rf:3,rp:2,a:2`
[6/0]	abbbba	6	`lf:4,lp:2,rf:3,rp:2,a:2`
[6/1]	aabbbb	5	`lf:3,lp:2,rf:1,rp:1,a:3`
[6/2]	bbbbaa	5	`lf:4,ls:1,rf:3,rp:1,rs:1,a:2`
[6/3]	bbaaaa	5	`lf:4,ls:1,rf:3,rp:1,a:3`

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

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	caa ⇒ aacc
2.	cbaa ⇒ acc
3.	acb ⇒ c
4.	acccb ⇒ cbac
5.	acccccb ⇒ cbcac
6.	acccccccb ⇒ cbccac
7.	bbac ⇒ ccb
8.	bbcac ⇒ ccccb
9.	bbccac ⇒ ccccccb
10.	bbcccac ⇒ ccccccccb
11.	bbaa ⇒ c
12.	ccbb ⇒ bbc
13.	bbcbac ⇒ ccbccb
14.	bbcbcac ⇒ ccbccccb
15.	bbccbac ⇒ ccccbccb
16.	bbcbcbac ⇒ ccbccbccb
17.	bbabbc ⇒ ccbcbb
18.	bbcabbc ⇒ ccccbcbb
19.	bbcbabbc ⇒ ccbccbcbb
20.	bbabbbbc ⇒ ccbcbbcbb
	...

Collecting factors up to length 6 / frequency 7:

[2/0]	bb	34	`lf:20,lp:13,ls:1,rf:6,rp:1,rs:4,lsrp:1,lprs:4,a:1`
[2/1]	ac	24	`lf:12,lp:4,ls:8,rf:5,rp:1,rs:3,lprs:3,a:2`
[2/2]	bc	19	`lf:15,ls:4,rf:14,rs:1,a:7`
[2/3]	cc	18	`lf:17,lp:1,rf:39,rp:12,rs:2,a:3`
[2/4]	cb	17	`lf:12,lp:1,ls:4,rf:26,rp:3,rs:8,lsrp:3,a:2`
[2/5]	ba	9	`lf:9,rf:1,a:1`
[2/6]	ca	7	`lf:6,lp:1,rf:2,a:5`
[3/0]	bbc	26	`lf:13,lp:9,ls:4,rf:2,rp:1,rs:1,re:1,a:7`
[3/1]	ccc	10	`lf:10,rf:18,rp:5,a:6`
[3/2]	ccb	9	`lf:5,lp:1,ls:3,rf:18,rp:7,rs:8,re:1,a:3`
[3/3]	bba	8	`lf:4,lp:4,a:1`
[3/4]	bac	8	`lf:4,ls:4,rf:1,rs:1,a:3`
[3/5]	cac	8	`lf:4,ls:4,rf:2,rs:2,a:9`
[3/6]	cba	6	`lf:5,lp:1,rf:1,rp:1,a:4`
[4/0]	bbcb	8	`lf:4,lp:4,rf:1,a:10`
[4/1]	abbc	6	`lf:3,ls:3,a:8`
[4/2]	bbcc	6	`lf:3,lp:3,a:12`
[4/3]	cccb	6	`lf:3,ls:3,rf:6,rs:4,a:6`
[4/4]	cbac	6	`lf:3,ls:3,rf:1,rp:1,rs:1,re:1,a:6`
[4/5]	accc	6	`lf:3,lp:3,a:6`
[4/6]	cccc	6	`lf:6,rf:12,rp:5,a:9`
[5/0]	bbabb	4	`lf:2,lp:2,a:8`
[5/1]	babbc	4	`lf:2,ls:2,a:8`
[5/2]	bbcba	4	`lf:2,lp:2,a:10`
[5/3]	bbcbc	4	`lf:2,lp:2,a:13`
[5/4]	bcbac	4	`lf:2,ls:2,a:10`
[5/5]	ccccb	4	`lf:2,ls:2,rf:6,rp:3,rs:4,re:1,a:9`
[5/6]	acccc	4	`lf:2,lp:2,a:11`

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

Step 3

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

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