Morphocompletion for #1851 ⟨a, b, c | aba=bb, acb=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	bbba ⇒ abbb
2.	cbbb ⇒ ba
3.	bbcb ⇒ ab
4.	aba ⇒ bb
5.	acb ⇒ 1
6.	cabbb ⇒ baa
7.	cba ⇒ 1
8.	cbbab ⇒ babcb
9.	bbcab ⇒ aab
10.	acab ⇒ bcb
11.	caabbb ⇒ baaa
12.	cabbab ⇒ baabcb
13.	cbbaab ⇒ babcab
14.	bbcaab ⇒ aaab
15.	acaab ⇒ bcab
16.	caaabbb ⇒ baaaa
17.	bbcaaab ⇒ aaaab
18.	acaaab ⇒ bcaab
19.	acaaaab ⇒ bcaaab
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	ab	26	`lf:15,lp:1,ls:10,rf:12,rp:2,rs:8,re:1,lsrs:7`
[2/1]	bb	26	`lf:17,lp:5,ls:4,rf:3,rp:1,rs:2,re:1,lprs:1`
[2/2]	ca	15	`lf:11,lp:4,rf:4,a:4`
[2/3]	aa	13	`lf:13,rf:16,rp:3,rs:3,a:5`
[2/4]	cb	12	`lf:6,lp:4,ls:2,rf:3,rs:3,lprs:1,a:1`
[2/5]	ac	10	`lf:5,lp:5,a:1`
[2/6]	ba	9	`lf:6,ls:3,rf:7,rp:7,rs:1,re:1`
[3/0]	aab	14	`lf:8,ls:6,rf:6,rp:1,rs:5,re:1,lsrs:4,a:5`
[3/1]	bbb	10	`lf:5,lp:1,ls:4,rf:1,rs:1,lprs:10,a:2`
[3/2]	caa	9	`lf:7,lp:2,rf:2,a:7`
[3/3]	aca	8	`lf:4,lp:4,a:4`
[3/4]	cab	8	`lf:4,lp:2,ls:2,rf:2,rs:2,a:4`
[3/5]	bbc	8	`lf:4,lp:4,a:3`
[3/6]	cbb	6	`lf:3,lp:3,a:10`

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

Step 2

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

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