Morphocompletion for #1811 ⟨a, b, c | aba=ab, bac=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

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.	abc ⇒ a
2.	abbc ⇒ ab
3.	abbbc ⇒ abb
4.	abbbbc ⇒ abbb
5.	abbbbbc ⇒ abbbb
6.	abbbbbbc ⇒ abbbbb
7.	abbbbbbbc ⇒ abbbbbb
8.	abbbbbbbbc ⇒ abbbbbbb
9.	abbbbbbbbbc ⇒ abbbbbbbb
10.	abbbbbbbbbbc ⇒ abbbbbbbbb
11.	bac ⇒ 1
12.	aba ⇒ ab
13.	abba ⇒ abb
14.	abbba ⇒ abbb
15.	abbbba ⇒ abbbb
16.	abbbbba ⇒ abbbbb
17.	abbbbbba ⇒ abbbbbb
18.	abbbbbbba ⇒ abbbbbbb
19.	abbbbbbbba ⇒ abbbbbbbb
20.	abbbbbbbbba ⇒ abbbbbbbbb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bb	81	`lf:81,rf:72,rs:16,a:2`
[2/1]	ab	38	`lf:19,lp:19,rf:18,rp:18,rs:2,re:2,lprp:18,lprs:2`
[2/2]	ba	20	`lf:10,lp:1,ls:9`
[2/3]	bc	20	`lf:10,ls:10,a:3`
[2/4]	ac	2	`lf:1,ls:1,a:1`
[3/0]	bbb	64	`lf:64,rf:56,rs:14,a:5`
[3/1]	abb	34	`lf:17,lp:17,rf:16,rp:16,rs:2,re:2,lprp:16,lprs:2,a:2`
[3/2]	bbc	18	`lf:9,ls:9,a:4`
[3/3]	bba	16	`lf:8,ls:8,a:2`

Considering [length 2 / frequency 1] ab=d.

Step 2

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

Rewriting system is complete. See ⟨a, b, c | aba=ab, bac=1⟩.