Morphocompletion for #1808 ⟨a, b | abbabaaab=b⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaaabbb ⇒ babaaab
2.	abbabb ⇒ bbabab
3.	abbabab ⇒ bbabaab
4.	abbabaab ⇒ bbabaaab
5.	abbabaaab ⇒ b
6.	aaaabbaabbb ⇒ babababaaab
7.	aaaabbaaabbb ⇒ babaababaaab
8.	bbabababaaab ⇒ abbb
9.	bbabaababaaab ⇒ aabbb
10.	bbabaaababaaab ⇒ aaabbb
11.	abbbbabab ⇒ bbabababb
12.	abbbbabaab ⇒ bbabababab
13.	abbbbabaaab ⇒ bbabababaab
14.	aaaabbaababbb ⇒ babaaaaababbb
15.	babaaababababaaab ⇒ aaaababbb
16.	bbabababababaaab ⇒ abbaabbb
17.	bbabababbbabaaab ⇒ abbbbabb
	...

Collecting factors up to length 7, frequency 4:

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

Checking up to 20 rules for overlaps.

Auxiliary generators:
1. c = ab
Reduction order:
- Left-to-right recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] ac, [2/1] cc, [2/2] cb, [2/3] bb, [2/4] bc, [2/5] ca, [2/6] aa
Length 3:	[3/0] bbc, [3/1] cbc, [3/2] cac, [3/3] bcc, [3/4] aac, [3/5] acc, [3/6] cca
Length 4:	[4/0] caac, [4/1] bbcc, [4/2] bcac, [4/3] cbcc, [4/4] ccbc, [4/5] cbca, [4/6] ccaa
Length 5:	[5/0] cbcac, [5/1] ccaac, [5/2] bbccb, [5/3] bccbc, [5/4] bbccc, [5/5] caacc, [5/6] accac

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

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

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