Morphocompletion for #2461 ⟨a, b | aaabba=baaa⟩

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

Step 1

Checking up to 20 rules for overlaps.

• Reduction order:
  • Right-to-left 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 3 / frequency 2] bba=c.

Step 2

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: rulesLimit

Collecting factors up to length 5, frequency 3:

Considering [length 2 / frequency 2] cc=d.

Step 3

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 4, frequency 3:

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

Step 4

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 7, frequency 2:

Considering [length 3 / frequency 0] eaa=f.

Step 5

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

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