Morphocompletion for #4843 ⟨a, b | ababbaba=bab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	ababbaba ⇒ bab
2.	ababbbab ⇒ babbbaba
3.	ababbabbab ⇒ babbabbaba
4.	babbbabaabbaba ⇒ ababbbbab
5.	babbbabaaabbaba ⇒ aababbbbab
6.	babbbabaaaabbaba ⇒ aaababbbbab
7.	babbbabaaaaabbaba ⇒ aaaababbbbab
8.	babbabbabaabbaba ⇒ ababbabbbab
9.	babbabbabaaabbaba ⇒ aababbabbbab
10.	ababbbbabbbaba ⇒ babbbabaabbbab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ba, [2/1] ab, [2/2] bb, [2/3] aa
Length 3:	[3/0] bab, [3/1] aba, [3/2] abb, [3/3] bba, [3/4] bbb, [3/5] aaa, [3/6] aab
Length 4:	[4/0] bbab, [4/1] baba, [4/2] babb, [4/3] abba, [4/4] abab, [4/5] abbb, [4/6] bbba
Length 5:	[5/0] bbaba, [5/1] abbab, [5/2] babbb, [5/3] babba, [5/4] bbbab, [5/5] ababb, [5/6] abbba
Length 6:	[6/0] abbaba, [6/1] babbab, [6/2] babbba, [6/3] abbbab, [6/4] bbbaba, [6/5] aabbab, [6/6] bbabaa
Length 7:	[7/0] aabbaba, [7/1] babbbab, [7/2] abbbaba, [7/3] babbabb, [7/4] bbabbab, [7/5] ababbab, [7/6] babbaba

Considering [length 5 / frequency 0] bbaba=c.

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

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