Morphocompletion for #1807 ⟨a, b | abbabaaab=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 ⇒ abbabaa
2.	aabaaab ⇒ ababaaa
3.	ababaaab ⇒ abbabaaa
4.	abbabaaab ⇒ a
5.	aaaababbbab ⇒ abbabaababa
6.	aaaabbaaabbb ⇒ abbabaababaa
7.	abbabaababaaa ⇒ aaaab
8.	abbabaabbabaaa ⇒ aaaabb
9.	ababaaaaaab ⇒ aabaababaaa
10.	abbabaaaaaab ⇒ ababaababaaa
11.	aaaababbbbabaaa ⇒ aaaabab
12.	abbabaabababbabaa ⇒ aaaababbb
	...

Collecting factors up to length 7, frequency 3:

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

Checking up to 20 rules for overlaps.

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

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] cc
Length 3:	[3/0] aac, [3/1] cbc, [3/2] cca, [3/3] caa, [3/4] aaa
Length 4:	[4/0] caac, [4/1] ccaa, [4/2] cbca, [4/3] bcac, [4/4] acca
Length 5:	[5/0] ccaac, [5/1] cbcac, [5/2] bcacc, [5/3] accaa, [5/4] cacca

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] db, [2/1] ad, [2/2] da, [2/3] ca, [2/4] dc
Length 3:	[3/0] cad, [3/1] dbc, [3/2] ada, [3/3] adb, [3/4] bca
Length 4:	[4/0] bcad, [4/1] dbca, [4/2] cada, [4/3] cadc, [4/4] cadb
Length 5:	[5/0] dbcad, [5/1] bcada, [5/2] cdbca, [5/3] adbca, [5/4] bcadc

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

Auxiliary generators:
1. c = ab
2. d = ac
3. e = bcada
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

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