Morphocompletion for #533 ⟨a, b | aabba=baa⟩

Solved by morph:4/0,3/0,3/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 4 / frequency 0] aabb=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] bc, [2/1] aa, [2/2] ab, [2/3] ca, [2/4] bb
Length 3:	[3/0] abc, [3/1] aab, [3/2] bbc, [3/3] bca, [3/4] cab
Length 4:	[4/0] aabc, [4/1] cabc, [4/2] aaca, [4/3] abcb, [4/4] bbbc
Length 5:	[5/0] aacab, [5/1] aabcb, [5/2] cabcb, [5/3] abcbb, [5/4] abcbc

Considering [length 3 / frequency 0] abc=d.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

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

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

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