Morphocompletion for #5697 ⟨a, b, c | aa=b, aca=ac⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	aca ⇒ ac
2.	acca ⇒ acc
3.	accca ⇒ accc
4.	acccca ⇒ acccc
5.	accccca ⇒ accccc
6.	acccccca ⇒ acccccc
7.	accccccca ⇒ accccccc
8.	acccccccca ⇒ acccccccc
9.	accccccccca ⇒ accccccccc
10.	acccccccccca ⇒ acccccccccc
11.	accccccccccca ⇒ accccccccccc
12.	acccccccccccca ⇒ acccccccccccc
13.	accccccccccccca ⇒ accccccccccccc
14.	acccccccccccccca ⇒ acccccccccccccc
15.	accccccccccccccca ⇒ accccccccccccccc
16.	acccccccccccccccca ⇒ acccccccccccccccc
17.	accccccccccccccccca ⇒ accccccccccccccccc
18.	acccccccccccccccccca ⇒ acccccccccccccccccc
19.	accccccccccccccccccca ⇒ accccccccccccccccccc
20.	b ⇒ aa
	...

Collecting factors up to length 4 / frequency 7:

Considering [length 2 / frequency 1] ac=d.

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

Rewriting system is complete. See ⟨a, b, c | aa=b, aca=ac⟩.