Morphocompletion for #12635 ⟨a, b | babb=ab, bbbb=b⟩

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

Step 1

Checking up to 80 rules for overlaps.

Rewriting system is not complete: stepTotalLimit

#	Rule
1.	bbbb ⇒ b
2.	bbbab ⇒ ab
3.	abb ⇒ bbab
4.	bbbaab ⇒ aab
5.	abab ⇒ bbaab
6.	bbbaaab ⇒ aaab
7.	abaab ⇒ bbaaab
8.	bbbaaaab ⇒ aaaab
9.	abaaab ⇒ bbaaaab
10.	bbbaaaaab ⇒ aaaaab
11.	abaaaab ⇒ bbaaaaab
12.	bbbaaaaaab ⇒ aaaaaab
13.	abaaaaab ⇒ bbaaaaaab
14.	bbbaaaaaaab ⇒ aaaaaaab
15.	abaaaaaab ⇒ bbaaaaaaab
16.	bbbaaaaaaaab ⇒ aaaaaaaab
17.	abaaaaaaab ⇒ bbaaaaaaaab
18.	bbbaaaaaaaaab ⇒ aaaaaaaaab
19.	abaaaaaaaab ⇒ bbaaaaaaaaab
20.	bbbaaaaaaaaaab ⇒ aaaaaaaaaab
21.	abaaaaaaaaab ⇒ bbaaaaaaaaaab
22.	bbbaaaaaaaaaaab ⇒ aaaaaaaaaaab
23.	abaaaaaaaaaab ⇒ bbaaaaaaaaaaab
	...

Collecting factors up to length 14 / frequency 2:

[2/0]	ab	12110	`lf:32,lp:11,ls:21,rf:22,rp:1,rs:22,re:1,lsrp:1,lprs:11,lsrs:21,a:4`
[2/1]	bb	1062	`lf:26,lp:12,ls:2,rf:11,rp:11,lsrp:1,a:1`
[3/0]	aab	1080	`lf:19,ls:19,rf:20,rp:1,rs:20,re:1,lsrp:1,lsrs:19,a:7`
[3/1]	aaa	180	`lf:81,rf:90,rp:9,a:11`
[4/0]	aaab	1072	`lf:17,ls:17,rf:18,rp:1,rs:18,re:1,lsrp:1,lsrs:17,a:11`
[4/1]	aaaa	144	`lf:64,rf:72,rp:8,a:14`
[5/0]	aaaab	1064	`lf:15,ls:15,rf:16,rp:1,rs:16,re:1,lsrp:1,lsrs:15,a:14`
[5/1]	aaaaa	112	`lf:49,rf:56,rp:7,a:16`
[6/0]	aaaaab	1056	`lf:13,ls:13,rf:14,rp:1,rs:14,re:1,lsrp:1,lsrs:13,a:16`
[6/1]	aaaaaa	84	`lf:36,rf:42,rp:6,a:19`
[7/0]	aaaaaab	1048	`lf:11,ls:11,rf:12,rp:1,rs:12,re:1,lsrp:1,lsrs:11,a:19`
[7/1]	aaaaaaa	60	`lf:25,rf:30,rp:5,a:21`
[8/0]	aaaaaaab	1040	`lf:9,ls:9,rf:10,rp:1,rs:10,re:1,lsrp:1,lsrs:9,a:21`
[8/1]	aaaaaaaa	40	`lf:16,rf:20,rp:4,a:23`
[9/0]	aaaaaaaab	1032	`lf:7,ls:7,rf:8,rp:1,rs:8,re:1,lsrp:1,lsrs:7,a:23`
[9/1]	aaaaaaaaa	24	`lf:9,rf:12,rp:3,a:26`
[10/0]	aaaaaaaaab	1024	`lf:5,ls:5,rf:6,rp:1,rs:6,re:1,lsrp:1,lsrs:5,a:26`
[10/1]	aaaaaaaaaa	12	`lf:4,rf:6,rp:2,a:28`
[11/0]	aaaaaaaaaab	1016	`lf:3,ls:3,rf:4,rp:1,rs:4,re:1,lsrp:1,lsrs:3,a:28`
[11/1]	bbaaaaaaaaa	9	`lf:3,rf:3,rp:3,a:26`
[12/0]	aaaaaaaaaaab	1008	`lf:1,ls:1,rf:2,rp:1,rs:2,re:1,lsrp:1,lsrs:1,a:30`
[12/1]	baaaaaaaaaab	6	`lf:2,ls:2,rf:1,rs:1,a:28`
[13/0]	bbaaaaaaaaaab	6	`lf:1,ls:1,rf:1,rp:1,rs:1,re:1,a:28`
[13/1]	baaaaaaaaaaab	4	`lf:1,ls:1,rf:1,rs:1,a:30`

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

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

Rewriting system is complete. See ⟨a, b | babb=ab, bbbb=b⟩.