Morphocompletion for #1986 ⟨a, b | aabbaaba=ab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ab, [2/1] ba, [2/2] bb, [2/3] aa
Length 3:	[3/0] abb, [3/1] aba, [3/2] aab, [3/3] bba, [3/4] bbb, [3/5] baa, [3/6] bab
Length 4:	[4/0] aaba, [4/1] abbb, [4/2] abba, [4/3] baab, [4/4] bbaa, [4/5] aabb, [4/6] babb
Length 5:	[5/0] baaba, [5/1] bbaab, [5/2] abbaa, [5/3] abbbb, [5/4] babba, [5/5] bbabb, [5/6] baabb
Length 6:	[6/0] bbaaba, [6/1] abbaab, [6/2] babbaa, [6/3] bbaabb, [6/4] bbabba, [6/5] abbbbb, [6/6] baaaba
Length 7:	[7/0] abbaaba, [7/1] babbaab, [7/2] abbaabb, [7/3] bbabbaa, [7/4] abaaaba, [7/5] bbbabba, [7/6] bbbaaba

Considering [length 3 / frequency 0] abb=c.

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

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