Morphocompletion for #1810 ⟨a, b, c | aba=ab, acc=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	aba ⇒ ab
2.	acc ⇒ 1
3.	abba ⇒ abb
4.	abcc ⇒ ab
5.	abbba ⇒ abbb
6.	abbcc ⇒ abb
7.	abbbba ⇒ abbbb
8.	abbbcc ⇒ abbb
9.	abbbbba ⇒ abbbbb
10.	abbbbcc ⇒ abbbb
11.	abbbbbba ⇒ abbbbbb
12.	abbbbbcc ⇒ abbbbb
13.	abbbbbbba ⇒ abbbbbbb
14.	abbbbbbcc ⇒ abbbbbb
15.	abbbbbbbba ⇒ abbbbbbbb
16.	abbbbbbbcc ⇒ abbbbbbb
17.	abbbbbbbbba ⇒ abbbbbbbbb
18.	abbbbbbbbcc ⇒ abbbbbbbb
19.	abbbbbbbbbba ⇒ abbbbbbbbbb
20.	abbbbbbbbbcc ⇒ abbbbbbbbb
	...

Collecting factors up to length 4 / frequency 7:

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

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

Step 2

Auxiliary generators:
1. d = ab
Reduction order:
- Left-to-right shortlex with a < d < b < c

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