Morphocompletion for #3761 ⟨a, b | ababaabaab=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

Collecting factors up to length 7, frequency 3:

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

Checking up to 20 rules for overlaps.

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] ba, [2/1] cb, [2/2] bc, [2/3] bb, [2/4] ab
Length 3:	[3/0] bba, [3/1] cbc, [3/2] bcb, [3/3] cba, [3/4] cbb
Length 4:	[4/0] cbba, [4/1] cbcb, [4/2] bcbc, [4/3] bcba, [4/4] abab
Length 5:	[5/0] bcbba, [5/1] cbcbb, [5/2] abcba, [5/3] cbbba, [5/4] ababc

Considering [length 2 / frequency 0] ba=d.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] ad, [2/1] da, [2/2] dd, [2/3] ab, [2/4] cd
Length 3:	[3/0] dad, [3/1] ddd, [3/2] ada, [3/3] dda, [3/4] dab
Length 4:	[4/0] dada, [4/1] adad, [4/2] ddad, [4/3] dddd, [4/4] adab
Length 5:	[5/0] dadad, [5/1] dadab, [5/2] ddada, [5/3] dddad, [5/4] ddadc

Considering [length 3 / frequency 0] dad=e.

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

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