Morphocompletion for #3808 ⟨a, b | abbaababba=b⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abbaabb ⇒ bababba
2.	abbaababba ⇒ b
3.	abbabababba ⇒ bababbaaabb
4.	abbaababbb ⇒ bbbaababba
5.	bababbaaababba ⇒ abbab
6.	abbaabababbab ⇒ bbabbaaababba
7.	abbabbbaababba ⇒ bababbaaababbb
8.	abbababbababba ⇒ bababbaaabbabb
9.	bababbaaabbababba ⇒ abbababb
10.	bababbaaabbbbaababba ⇒ abbabababbb
	...

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] abb, [3/1] bba, [3/2] bab, [3/3] aba, [3/4] aab, [3/5] baa, [3/6] bbb
Length 4:	[4/0] abba, [4/1] abab, [4/2] babb, [4/3] baba, [4/4] bbaa, [4/5] bbab, [4/6] baab
Length 5:	[5/0] babba, [5/1] ababb, [5/2] babab, [5/3] abbaa, [5/4] abbab, [5/5] bbaab, [5/6] aabab
Length 6:	[6/0] ababba, [6/1] bababb, [6/2] abbaab, [6/3] abbaba, [6/4] aababb, [6/5] baabab, [6/6] bbaaba
Length 7:	[7/0] bababba, [7/1] aababba, [7/2] abbabab, [7/3] abbaaba, [7/4] bbaabab, [7/5] baababb, [7/6] bbababb

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

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

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