Morphocompletion for #2609 ⟨a, b, c | aba=b, accb=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	accb ⇒ 1
2.	accab ⇒ ccb
3.	accaab ⇒ ccab
4.	accaaab ⇒ ccaab
5.	accaaaab ⇒ ccaaab
6.	accaaaaab ⇒ ccaaaab
7.	aba ⇒ b
8.	ccba ⇒ 1
9.	ccbb ⇒ ba
10.	ccabb ⇒ baa
11.	ccaabb ⇒ baaa
12.	ccaaabb ⇒ baaaa
13.	ccaaaabb ⇒ baaaaa
14.	bccb ⇒ ab
15.	bccab ⇒ aab
16.	bccaab ⇒ aaab
17.	bccaaab ⇒ aaaab
18.	bccaaaab ⇒ aaaaab
19.	bba ⇒ abb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	ab	24	`lf:14,lp:1,ls:9,rf:10,rp:2,rs:9,re:1,lsrs:8`
[2/1]	cc	23	`lf:17,lp:6,rf:5,rp:5,a:1`
[2/2]	aa	22	`lf:22,rf:26,rp:4,rs:4,a:5`
[2/3]	ca	13	`lf:13,rf:4,a:4`
[2/4]	bb	12	`lf:6,lp:1,ls:5,rf:1,rs:1,lprs:10,a:2`
[2/5]	ac	12	`lf:6,lp:6,a:1`
[2/6]	bc	10	`lf:5,lp:5,a:3`
[3/0]	aab	17	`lf:10,ls:7,rf:7,rp:1,rs:7,re:1,lsrs:6,a:5`
[3/1]	cca	17	`lf:13,lp:4,rf:4,rp:4,a:4`
[3/2]	aaa	12	`lf:12,rf:15,rp:3,rs:3,a:15`
[3/3]	acc	12	`lf:6,lp:6,a:1`
[3/4]	bcc	10	`lf:5,lp:5,a:3`
[3/5]	caa	10	`lf:10,rf:3,a:14`
[3/6]	abb	8	`lf:4,ls:4,rf:1,rp:1,rs:1,re:1,a:2`

Considering [length 3 / frequency 0] aab=d.

Step 2

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

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