Morphocompletion for #3812 ⟨a, b | abbabaaaab=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: rulesLimit

Collecting factors up to length 4, frequency 3:

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

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 5, frequency 3:

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

Step 3

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 4, frequency 3:

Considering [length 2 / frequency 1] ad=e.

Step 4

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 7, frequency 2:

Considering [length 6 / frequency 0] ebcaea=f.

Step 5

• Reduction order:
  • Right-to-left recursive path with deg(b) = deg(d) = deg(c) = deg(e) = 0, b < d < c < e; deg(f) = deg(a) = 1, f < a
• Auxiliary generators:
  1. ab=c
  2. ac=d
  3. ad=e
  4. ebcaea=f

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