Morphocompletion for #3767 ⟨a, b | abababaaab=a⟩

Solved by morph:3/0,2/1,4/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 3 / frequency 0] aaa=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] cb, [2/1] ab, [2/2] ba, [2/3] aa, [2/4] bc
Length 3:	[3/0] bcb, [3/1] bab, [3/2] aba, [3/3] cba, [3/4] abc
Length 4:	[4/0] abcb, [4/1] abab, [4/2] cbab, [4/3] babc, [4/4] cbcb
Length 5:	[5/0] babcb, [5/1] ababa, [5/2] bcbba, [5/3] cbabc, [5/4] babab

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] dd, [2/1] ad, [2/2] da, [2/3] cd, [2/4] aa
Length 3:	[3/0] ddd, [3/1] aad, [3/2] dda, [3/3] cdb, [3/4] daa
Length 4:	[4/0] ddda, [4/1] daad, [4/2] addd, [4/3] dadd, [4/4] ddad
Length 5:	[5/0] dddad, [5/1] cdaad, [5/2] ddaad, [5/3] daddd, [5/4] ddadd

Considering [length 4 / frequency 0] ddda=e.

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

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