Morphocompletion for #3817 ⟨a, b | abbabbaaab=a⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aaaabbb ⇒ ababbaa
2.	abaaabbb ⇒ abbabbaa
3.	aabbaaab ⇒ ababbaaa
4.	ababbaaab ⇒ abbabbaaa
5.	abbabbaaab ⇒ a
6.	ababbaababbaaa ⇒ aaaab
7.	abbabbaababbaaa ⇒ abaaab
8.	ababbaabbabbaaa ⇒ aaaabb
9.	abbabbaabbabbaaa ⇒ abaaabb
10.	abbabbaaaaaab ⇒ aabbaababbaaa
11.	aaaababbbbabbaaa ⇒ aaaabab
12.	ababbaababbababbaa ⇒ aaaababbb
	...

Collecting factors up to length 7, frequency 3:

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] cb, [2/1] ac, [2/2] aa, [2/3] cc, [2/4] ba
Length 3:	[3/0] ccb, [3/1] cba, [3/2] aac, [3/3] cbc, [3/4] baa
Length 4:	[4/0] ccba, [4/1] baac, [4/2] cbaa, [4/3] cbcb, [4/4] accb
Length 5:	[5/0] ccbaa, [5/1] cbaac, [5/2] cbcba, [5/3] cbaaa, [5/4] caacb

Considering [length 3 / frequency 1] cba=d.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] ad, [2/1] cb, [2/2] da, [2/3] ac, [2/4] cd
Length 3:	[3/0] dad, [3/1] cda, [3/2] dac, [3/3] cbd, [3/4] aca
Length 4:	[4/0] cdad, [4/1] daca, [4/2] cbcd, [4/3] cdac, [4/4] acda
Length 5:	[5/0] cdaca, [5/1] dcdad, [5/2] cbcda, [5/3] cbdcd, [5/4] acdac

Considering [length 4 / frequency 1] daca=e.

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

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