Morphocompletion for #4822 ⟨a, b | abababab=baa⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	baaab ⇒ abbaa
2.	abababab ⇒ baa
3.	baaaabbaa ⇒ abbaaaaab
4.	abababaabbaa ⇒ baaaaab
5.	baaaababbaa ⇒ abbaaaaabab
6.	abababaababbaa ⇒ baaaaabab
7.	baaaaabbababab ⇒ abababaabbabaa
8.	baaaabababbaa ⇒ abbaaaaababab
9.	abababaabababbaa ⇒ baaaaababab
10.	baaaaababbababab ⇒ abababaababbabaa
11.	baaaaabababbababab ⇒ abababaabababbabaa
12.	baaaaabbababaabbaa ⇒ abababaabbabaaaaab
13.	baaaabababaabbabaa ⇒ abbaaaaaaabbababab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ba, [2/1] ab, [2/2] aa, [2/3] bb
Length 3:	[3/0] baa, [3/1] aba, [3/2] bab, [3/3] aaa, [3/4] aab, [3/5] bba, [3/6] abb
Length 4:	[4/0] abab, [4/1] baba, [4/2] baaa, [4/3] bbaa, [4/4] aaaa, [4/5] abba, [4/6] aaab
Length 5:	[5/0] ababa, [5/1] babab, [5/2] baaaa, [5/3] abbaa, [5/4] aaaab, [5/5] babaa, [5/6] aabab
Length 6:	[6/0] ababab, [6/1] bababa, [6/2] baaaaa, [6/3] baaaab, [6/4] babbaa, [6/5] aabbaa, [6/6] ababba
Length 7:	[7/0] abababa, [7/1] baaaaab, [7/2] ababbaa, [7/3] bababab, [7/4] baaaaba, [7/5] aaaabab, [7/6] bababaa

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

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

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