Morphocompletion for #5401 ⟨a, b | abbabba=abab⟩

Solved by morph:6/1,3/1. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abbabab ⇒ ababbba
2.	abbabba ⇒ abab
3.	ababbbaabb ⇒ abababbbba
4.	ababbbabab ⇒ ababbabbba
5.	ababbbabba ⇒ ababbab
6.	ababbabbbaab ⇒ abababbbbaba
7.	ababbabbbaba ⇒ ababbbaab
8.	abababbbbabba ⇒ abababbbab
9.	ababbabbbabba ⇒ abababb
10.	abababbabbbbaa ⇒ ababbbaabab
	...

Collecting factors up to length 7, frequency 4:

Considering [length 6 / frequency 1] ababbb=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] ab, [2/1] ca, [2/2] ba, [2/3] bb, [2/4] cc, [2/5] bc, [2/6] cb
Length 3:	[3/0] abb, [3/1] bab, [3/2] aba, [3/3] cab, [3/4] bba, [3/5] cca, [3/6] abc
Length 4:	[4/0] abba, [4/1] abab, [4/2] caba, [4/3] caab, [4/4] bbab, [4/5] babb, [4/6] abbc
Length 5:	[5/0] abbab, [5/1] ababb, [5/2] abbca, [5/3] cabab, [5/4] babba, [5/5] bcaab, [5/6] cabca

Considering [length 3 / frequency 1] bab=d.

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

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