Morphocompletion for #2621 ⟨a, b, c | aba=b, bccb=1⟩

Solved by morph:2/0. (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 ⇒ b
2.	bba ⇒ abb
3.	cbb ⇒ bbc
4.	cca ⇒ acc
5.	ccb ⇒ bcc
6.	bbcc ⇒ 1
7.	cabb ⇒ bbca
8.	caabb ⇒ bbcaa
9.	cbabb ⇒ bbcba
10.	bbcacc ⇒ ca
11.	bbcbcc ⇒ cb
12.	bbcaacc ⇒ caa
13.	bbcabcc ⇒ cab
14.	bbcbacc ⇒ cba
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bb	22	`lf:11,lp:7,ls:4,rf:5,rp:4,rs:1,lsrp:13,lprs:10,a:2`
[2/1]	cc	16	`lf:8,lp:2,ls:6,rf:2,rs:2,lprs:20,a:3`
[2/2]	ca	9	`lf:6,lp:2,ls:1,rf:5,rp:3,rs:2,re:1,lprs:1,a:9`
[2/3]	cb	8	`lf:5,lp:2,ls:1,rf:3,rp:2,rs:1,re:1,a:3`
[2/4]	bc	8	`lf:8,rf:5,rp:1,rs:1,a:3`
[2/5]	ba	6	`lf:4,ls:2,rf:2,rs:2`
[2/6]	ab	6	`lf:5,lp:1,rf:2,rp:1,rs:1`
[3/0]	bbc	12	`lf:6,lp:6,rf:4,rp:4,rs:1,re:1,a:10`
[3/1]	bcc	6	`lf:3,ls:3,rf:1,rp:1,rs:1,re:1,a:3`
[3/2]	acc	6	`lf:3,ls:3,rf:1,rp:1,rs:1,re:1,a:9`
[3/3]	abb	6	`lf:3,ls:3,rf:1,rp:1,rs:1,re:1,a:2`
[3/4]	cba	3	`lf:2,lp:1,rf:2,rp:1,rs:2,re:1,lprs:1,a:19`
[3/5]	cab	3	`lf:2,lp:1,rf:1,rp:1,rs:1,re:1,a:13`
[3/6]	caa	3	`lf:2,lp:1,rf:2,rp:1,rs:2,re:1,lprs:1,a:15`

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

Step 2

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

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