Morphocompletion for #4289 ⟨a, b | ababaabab=ba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abababa ⇒ baaabab
2.	ababaabab ⇒ ba
3.	baaababba ⇒ abbaaabab
4.	ababaabba ⇒ baabaabab
5.	baaabbaaba ⇒ abbaaaabab
6.	baabaaababb ⇒ abba
7.	baaabbaaabab ⇒ abbaa
8.	baaabababba ⇒ abbaabaabab
9.	ababaabaabba ⇒ baaabaaababb
10.	baaabbaaabba ⇒ abbaaabaabab
11.	ababaabaababba ⇒ baaaababbaabab
12.	abbaaaababbaba ⇒ baaabbabaaabab
13.	abbaaaababbaabab ⇒ baaabbaba
14.	baabaababbabaabab ⇒ ababaabbba
	...

Collecting factors up to length 7, frequency 4:

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] ba, [2/1] ab, [2/2] cc, [2/3] bc, [2/4] ac, [2/5] cb, [2/6] bb
Length 3:	[3/0] bba, [3/1] bac, [3/2] abb, [3/3] ccb, [3/4] acc, [3/5] abc, [3/6] bbc
Length 4:	[4/0] abba, [4/1] bacb, [4/2] abbc, [4/3] cbba, [4/4] aabb, [4/5] ccab, [4/6] accc
Length 5:	[5/0] ccbba, [5/1] ccabb, [5/2] cbabc, [5/3] cabbc, [5/4] bacba, [5/5] cabba, [5/6] cbacb

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

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

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