Morphocompletion for #1228 ⟨a, b | aabba=abab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabba ⇒ abab
2.	abababba ⇒ ababbab
3.	ababbababba ⇒ ababbabbab
4.	ababbabbabba ⇒ ababbabbbab
5.	ababbabbbabba ⇒ ababbabbbbab
6.	ababbabbababba ⇒ ababbabbbabb
7.	ababbabbbabbba ⇒ ababbabbabbbab
8.	ababbabbbbabba ⇒ ababbabbbbbab
	...

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] bba, [3/1] bab, [3/2] abb, [3/3] aba, [3/4] bbb, [3/5] aab
Length 4:	[4/0] abba, [4/1] babb, [4/2] abab, [4/3] bbab, [4/4] bbba, [4/5] abbb, [4/6] baba
Length 5:	[5/0] babba, [5/1] ababb, [5/2] bbabb, [5/3] abbab, [5/4] babbb, [5/5] abbba, [5/6] bbbab
Length 6:	[6/0] ababba, [6/1] bbabba, [6/2] babbab, [6/3] abbabb, [6/4] bbabbb, [6/5] babbba, [6/6] bbbabb
Length 7:	[7/0] ababbab, [7/1] babbabb, [7/2] bababba, [7/3] bbbabba, [7/4] bbabbba, [7/5] abbabba, [7/6] abbabbb

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

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

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