Morphocompletion for #5831 ⟨a, b | abaaab=babba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abaaab ⇒ babba
2.	babbaaaab ⇒ abaababba
3.	abaaaabaababba ⇒ babbaabbaaaab
4.	abaababbaabbaaaab ⇒ babbaaaaabaababba
5.	babbaabbaaaabbaaab ⇒ abaaaabaababbbabba
6.	abaababbaaaaabaababba ⇒ babbaaababbaabbaaaab
7.	abaaaabaabababaababba ⇒ babbaabbaaaabbbaaaab
8.	abaaaabaaaabaababbbabba ⇒ babbaabbaabbaaaabbaaab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ab, [2/1] ba, [2/2] aa, [2/3] bb
Length 3:	[3/0] aba, [3/1] aab, [3/2] aaa, [3/3] baa, [3/4] bba, [3/5] bab, [3/6] abb
Length 4:	[4/0] abaa, [4/1] abba, [4/2] aaab, [4/3] aaba, [4/4] babb, [4/5] baaa, [4/6] aaaa
Length 5:	[5/0] babba, [5/1] aaaab, [5/2] abaaa, [5/3] abaab, [5/4] baaaa, [5/5] aabab, [5/6] baaba
Length 6:	[6/0] baaaab, [6/1] abaaba, [6/2] ababba, [6/3] abaaaa, [6/4] baabab, [6/5] aababb, [6/6] babbaa
Length 7:	[7/0] abaabab, [7/1] aababba, [7/2] abaaaab, [7/3] baababb, [7/4] aaaabaa, [7/5] bbaaaab, [7/6] aaabaab

Considering [length 4 / frequency 0] abaa=c.

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

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