Morphocompletion for #4816 ⟨a, b | ababaaab=bab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

Collecting factors up to length 7, frequency 4:

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

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
Auxiliary generators:
1. ab=c

Rewriting system is not complete: roundsLimit

#	Rule
1.	accacc ⇒ cccaac
2.	accaac ⇒ cc
3.	cccaacaac ⇒ acccc
4.	acccccaac ⇒ cccaacacc
5.	accacacccc ⇒ cccaaacccc
6.	accaaacccc ⇒ cacccc
7.	accacacacccc ⇒ cccaaacacccc
8.	accaaacacccc ⇒ cacacccc
9.	cccaacacccaac ⇒ acccccacc
10.	cccaacaaacccc ⇒ acccacccc
11.	acccccacccaac ⇒ cccaacacccacc
12.	acccccaaacccc ⇒ cccaacacacccc
13.	accaaacccacccc ⇒ cacccacccc
14.	accaaacacacccc ⇒ cacacacccc
15.	bc ⇒ ccaac
16.	bacccc ⇒ ccaaacccc
17.	bacacccc ⇒ ccaaacacccc
18.	bacccacccc ⇒ ccaaacccacccc
19.	bacacacccc ⇒ ccaaacacacccc
20.	ab ⇒ c
	...

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] cc, [2/1] ac, [2/2] ca, [2/3] aa, [2/4] ba
Length 3:	[3/0] ccc, [3/1] acc, [3/2] aac, [3/3] cca, [3/4] cac, [3/5] caa, [3/6] aca
Length 4:	[4/0] cccc, [4/1] accc, [4/2] acca, [4/3] caac, [4/4] ccca, [4/5] cacc, [4/6] ccaa
Length 5:	[5/0] acccc, [5/1] ccaac, [5/2] accaa, [5/3] caccc, [5/4] cccaa, [5/5] acacc, [5/6] accac

Considering [length 3 / frequency 2] aac=d.

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

Rewriting system is complete. See ⟨a, b | ababaaab=bab⟩.