Morphocompletion for #3805 ⟨a, b | abbaabaaab=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaaabbb ⇒ abbaaba
2.	aaabaaab ⇒ abaabaaa
3.	abaabaaab ⇒ abbaabaaa
4.	abbaabaaab ⇒ a
5.	aaaabbaaabbb ⇒ abbaababaaba
6.	abbaababaabaaa ⇒ aaaab
7.	abbaababbaabaaa ⇒ aaaabb
8.	abaabaaaaaab ⇒ aaababaabaaa
9.	abbaabaaaaaab ⇒ abaababaabaaa
10.	aaaababbbbaabaaa ⇒ aaaabab
11.	abbaababaababbaaba ⇒ aaaababbb
	...

Collecting factors up to length 7, frequency 3:

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] ac, [2/1] aa, [2/2] cb, [2/3] ca, [2/4] ba
Length 3:	[3/0] aac, [3/1] aaa, [3/2] aca, [3/3] cba, [3/4] cac
Length 4:	[4/0] aaac, [4/1] cbac, [4/2] caca, [4/3] caac, [4/4] acaa
Length 5:	[5/0] cacaa, [5/1] acaac, [5/2] cbacc, [5/3] aaacb, [5/4] cbaca

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] ad, [2/1] da, [2/2] db, [2/3] bd, [2/4] dd
Length 3:	[3/0] dad, [3/1] dbd, [3/2] bda, [3/3] ada, [3/4] adb
Length 4:	[4/0] dbda, [4/1] bdad, [4/2] dada, [4/3] dadc, [4/4] dadb
Length 5:	[5/0] dbdad, [5/1] bdada, [5/2] ddbda, [5/3] bdadd, [5/4] addad

Considering [length 5 / frequency 1] bdada=e.

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

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