Morphocompletion for #3755 ⟨a, b | ababaaaaab=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaaaaabba ⇒ aabaaaaab
2.	ababaaaa ⇒ aaaaaabb
3.	aabaaaaabb ⇒ a
4.	aaaaaabaaaabba ⇒ aabaaaaabaaaab
5.	aabaaaaababba ⇒ ababaabaaaaab
6.	aabaaaaabaabba ⇒ ababaaabaaaaab
7.	aabaaaaabaaabba ⇒ aaaaaabbbaaaaab
8.	aabaaaaabaaaabba ⇒ aaaaaab
9.	aaaaaabbbabaaaa ⇒ aabaaaaabaaaabb
10.	aaaaaabbbaaaaabb ⇒ ababaaa
	...

Collecting factors up to length 7, frequency 3:

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ccaaaac ⇒ a
2.	acaaaac ⇒ ccaaaaa
3.	ccaaaccaaaaa ⇒ aaaaac
4.	ccaaaaaaaaac ⇒ acaaaccaaaaa
5.	ccaaaaacaaaccaaaaa ⇒ acaaaaaaaaac
6.	ab ⇒ c
7.	aaaaacb ⇒ ccaaaa
8.	aaaaaccb ⇒ ccaaaccccaaaa
9.	aaaaacccb ⇒ ccaaaccccaaaccccaaaa
10.	aaaaacacb ⇒ ccaaaccaccaaaa
11.	aaaaaccacb ⇒ ccaaaccccaaaccaccaaaa
12.	aaaaacaccb ⇒ ccaaaccaccaaaccccaaaa
13.	aaaaacaacb ⇒ ccaaaccaaccaaaa
14.	aaaaaccaacb ⇒ ccaaaccccaaaccaaccaaaa
15.	aaaaacacacb ⇒ ccaaaccaccaaaccaccaaaa
16.	aaaaacaaccb ⇒ ccaaaccaaccaaaccccaaaa
17.	aaaaacaaacb ⇒ ccaaaccaaaccaaaa
18.	aaaaaccaaacb ⇒ ccaaaccccaaaccaaaccaaaa
19.	aaaaacacaacb ⇒ ccaaaccaccaaaccaaccaaaa
20.	aaaaacaacacb ⇒ ccaaaccaaccaaaccaccaaaa
	...

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] aa, [2/1] ac, [2/2] cb, [2/3] ca, [2/4] cc
Length 3:	[3/0] aaa, [3/1] aac, [3/2] acb, [3/3] caa, [3/4] aca
Length 4:	[4/0] aaaa, [4/1] aaac, [4/2] aacb, [4/3] ccaa, [4/4] aaca
Length 5:	[5/0] aaaaa, [5/1] aaaac, [5/2] ccaaa, [5/3] aaaca, [5/4] aaacc

Considering [length 5 / frequency 0] aaaaa=d.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] aa, [2/1] cc, [2/2] ac, [2/3] ca, [2/4] dc
Length 3:	[3/0] aaa, [3/1] cca, [3/2] aac, [3/3] caa, [3/4] aad
Length 4:	[4/0] ccaa, [4/1] aaac, [4/2] caaa, [4/3] aaaa, [4/4] aacc
Length 5:	[5/0] ccaaa, [5/1] aaaac, [5/2] caaaa, [5/3] aaacc, [5/4] caaac

Considering [length 5 / frequency 4] caaac=e.

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

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