Morphocompletion for #5298 ⟨a, b | abaaaba=aaab⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: rulesLimit

Collecting factors up to length 4, frequency 3:

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

Step 2

Checking up to 20 rules for overlaps.

• Reduction order:
  • Left-to-right recursive path with deg(c) = 0; deg(a) = 1; deg(b) = 2
• Auxiliary generators:
  1. aa=c

Rewriting system is not complete: roundsLimit

Collecting factors up to length 5, frequency 3:

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

Step 3

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 4, frequency 3:

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

Step 4

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 7, frequency 2:

Considering [length 4 / frequency 0] ddce=f.

Step 5

• Reduction order:
  • Left-to-right recursive path with deg(c) = deg(e) = deg(f) = 0, c < e < f; deg(d) = deg(a) = 1, d < a; deg(b) = 2
• Auxiliary generators:
  1. aa=c
  2. ba=d
  3. dcd=e
  4. ddce=f

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