Morphocompletion for #1670 ⟨a, b, c | aab=ba, cba=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) = 0; deg(b) = 1; deg(a) = 2

Rewriting system is not complete: pendingRulesLimit

#	Rule
1.	cba ⇒ 1
2.	cbcbba ⇒ b
3.	cbcbbba ⇒ bcbba
4.	cbcbbbba ⇒ bcbbba
5.	cbcbbcbba ⇒ bb
6.	cbcbbbbba ⇒ bcbbbba
7.	cbcbbcbbba ⇒ bbcbba
8.	cbcbbcbbcbba ⇒ bbb
9.	ab ⇒ cbba
10.	acbba ⇒ ba
11.	acbbba ⇒ bba
12.	acbbbba ⇒ bbba
13.	acbbcbba ⇒ bcbba
14.	acbbbbba ⇒ bbbba
15.	acbbcbbba ⇒ bcbbba
16.	acbbbcbba ⇒ bbcbba
17.	acbbbbbba ⇒ bbbbba
18.	acbbcbbbba ⇒ bcbbbba
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bb	45	`lf:45,rf:30,rp:8,rs:2,re:1,a:2`
[2/1]	cb	40	`lf:32,lp:8,rf:9,rp:1,a:1`
[2/2]	ba	34	`lf:17,ls:17,rf:14,rp:1,rs:14,re:1,lsrp:1,lsrs:13,a:1`
[2/3]	ac	18	`lf:9,lp:9,a:18`
[2/4]	bc	15	`lf:15,rf:8,rp:6,a:3`
[3/0]	bba	32	`lf:16,ls:16,rf:13,rp:1,rs:13,re:1,lsrp:1,lsrs:12,a:2`
[3/1]	cbb	24	`lf:24,rf:9,rp:1,a:2`
[3/2]	bbb	21	`lf:21,rf:13,rp:4,rs:1,re:1,a:4`
[3/3]	acb	18	`lf:9,lp:9,a:18`
[3/4]	bcb	15	`lf:15,rf:8,rp:6,a:3`
[3/5]	cbc	14	`lf:7,lp:7,a:3`
[3/6]	bbc	8	`lf:8,rf:2,rp:2,a:5`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | aab=ba, cba=1⟩.