Morphocompletion for #5819 ⟨a, b, c | ab=a, aca=bc⟩

Back:⟨a, b, c | ab=a, aca=bc⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: roundsLimit

#Rule
1. ab ⇒ a
2. acb ⇒ ac
3. bc ⇒ aca
4. aaca ⇒ ac
5. accb ⇒ acc
6. acaca ⇒ acc
7. aacc ⇒ acca
8. acccb ⇒ accc
9. accaca ⇒ accc
10. acacc ⇒ accca
11. accccb ⇒ acccc
12. acccaca ⇒ acccc
13. accacc ⇒ acccca
14. acccccb ⇒ accccc
15. accccaca ⇒ accccc
16. acccacc ⇒ accccca
17. accccccb ⇒ acccccc
18. acccccaca ⇒ acccccc
19. accccacc ⇒ acccccca
20. acccccccb ⇒ accccccc
...

Collecting factors up to length 4 / frequency 7:

[2/0]cc47lf:42,ls:5,rf:51,rs:11,a:4
[2/1]ac43lf:27,lp:16,rf:19,rp:19,rs:2,re:2,lprp:16,lprs:1,a:1
[2/2]ca21lf:15,ls:6,rf:6,rs:6,a:1
[2/3]cb14lf:7,ls:7,a:3
[2/4]aa4lf:2,lp:2,a:2
[3/0]acc36lf:18,lp:13,ls:5,rf:16,rp:16,rs:2,re:2,lprp:13,lsrp:14,lprs:1,a:4
[3/1]ccc24lf:24,rf:35,rs:9,a:6
[3/2]aca16lf:8,lp:2,ls:6,rf:1,rp:1,rs:1,re:1,a:1
[3/3]ccb12lf:6,ls:6,a:5
[3/4]cac9lf:9,a:4
[3/5]cca7lf:7,rf:5,rs:5,a:7
[3/6]aac4lf:2,lp:2,a:2

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

Step 2

Rewriting system is complete. See ⟨a, b, c | ab=a, aca=bc⟩.