Morphocompletion for #4319 ⟨a, b | ababbbaba=ab⟩

Solved by morph:4/1. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right shortlex with a < b

Rewriting system is not complete: roundsLimit

#	Rule
1.	abbbbaba ⇒ ababbbab
2.	ababbbaba ⇒ ab
3.	abbbbbaba ⇒ abbabbbab
4.	abbabbbaba ⇒ abb
5.	abbbbbbaba ⇒ abbbabbbab
6.	abbbabbbaba ⇒ abbb
7.	abbbbbbbaba ⇒ abbbbabbbab
8.	abbbbabbbaba ⇒ abbbb
9.	abbbbbbbbaba ⇒ abbbbbabbbab
10.	abbbbbabbbaba ⇒ abbbbb
11.	abbbbbbbbbaba ⇒ abbbbbbabbbab
12.	abbbbbbabbbaba ⇒ abbbbbb
13.	abbbbbbbbbbaba ⇒ abbbbbbbabbbab
14.	abbbbbbbabbbaba ⇒ abbbbbbb
15.	abbbbbbbbbbbaba ⇒ abbbbbbbbabbbab
16.	abbbbbbbbabbbaba ⇒ abbbbbbbb
17.	abbbbbbbbbbbbaba ⇒ abbbbbbbbbabbbab
18.	abbbbbbbbbabbbaba ⇒ abbbbbbbbb
19.	abbbbbbbbbbabbbaba ⇒ abbbbbbbbbb
20.	abbbbbbbbbbbabbbaba ⇒ abbbbbbbbbbb
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	bb	140	`lf:140,rf:109,rs:10`
[2/1]	ba	71	`lf:51,ls:20,rf:18`
[2/2]	ab	71	`lf:51,lp:20,rf:38,rp:20,rs:10,re:1,lprp:20,lprs:10`
[3/0]	bbb	110	`lf:110,rf:82,rs:9`
[3/1]	abb	49	`lf:30,lp:19,rf:27,rp:18,rs:1,re:1,lprp:18,lprs:1`
[3/2]	aba	42	`lf:21,lp:1,ls:20,rf:1,rp:1,lsrp:1`
[3/3]	bab	31	`lf:31,rf:18,rs:9`
[3/4]	bba	30	`lf:30,rf:17`
[4/0]	bbbb	81	`lf:81,rf:57,rs:8,a:1`
[4/1]	abbb	47	`lf:29,lp:18,rf:25,rp:16,rs:1,re:1,lprp:16,lprs:1`
[4/2]	baba	40	`lf:20,ls:20`
[4/3]	bbab	30	`lf:30,rf:17,rs:9`
[4/4]	bbba	29	`lf:29,rf:16`
[4/5]	babb	11	`lf:11,rf:9`
[4/6]	abba	2	`lf:1,lp:1,rf:1,rp:1,a:2`
[5/0]	bbbbb	64	`lf:64,rf:43,rs:7,a:4`
[5/1]	bbaba	40	`lf:20,ls:20`
[5/2]	abbbb	34	`lf:17,lp:17,rf:14,rp:14,rs:1,re:1,lprp:14,lprs:1,a:1`
[5/3]	bbbab	29	`lf:29,rf:16,rs:9`
[5/4]	bbbba	17	`lf:17,rf:6,a:1`
[5/5]	abbba	13	`lf:12,lp:1,rf:10,rp:1`
[5/6]	babbb	11	`lf:11,rf:9`
[6/0]	bbbbbb	49	`lf:49,rf:31,rs:6,a:7`
[6/1]	bbbaba	40	`lf:20,ls:20`
[6/2]	abbbbb	30	`lf:15,lp:15,rf:12,rp:12,rs:1,re:1,lprp:12,lprs:1,a:4`
[6/3]	bbbbab	17	`lf:17,rf:6,a:1`
[6/4]	bbbbba	15	`lf:15,rf:5,a:4`
[6/5]	abbbab	13	`lf:12,lp:1,rf:10,rp:1,rs:9`
[6/6]	babbba	11	`lf:11,rf:9`
[7/0]	bbbbbbb	36	`lf:36,rf:21,rs:5,a:9`
[7/1]	abbbbbb	26	`lf:13,lp:13,rf:10,rp:10,rs:1,re:1,lprp:10,lprs:1,a:7`
[7/2]	abbbaba	22	`lf:11,ls:11`
[7/3]	bbbbaba	18	`lf:9,ls:9,a:1`
[7/4]	bbbbbab	15	`lf:15,rf:5,a:4`
[7/5]	bbbbbba	13	`lf:13,rf:4,a:7`
[7/6]	babbbab	11	`lf:11,rf:9,rs:9`

Considering [length 4 / frequency 1] abbb=c.

Step 2

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

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