Morphocompletion for #2591 ⟨a, b | ababab=aaba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abaaba ⇒ aabaab
2.	ababab ⇒ aaba
3.	aabaabbab ⇒ abaaaba
4.	abaaabaab ⇒ aaabaabba
5.	abaaaabaab ⇒ aaabaabbaa
6.	aaabaabbbab ⇒ ababaaaba
7.	aabaabbaaba ⇒ aaabaabbaab
8.	abaaaaabaab ⇒ aaabaabbaaa
9.	abaaaaaabaab ⇒ aaabaabbaaaa
10.	aaaabaabbaabb ⇒ abaaabaaaba
11.	aaabaabbbaaba ⇒ aabaaabaaab
12.	abaaaaaaabaab ⇒ aaabaabbaaaaa
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ab, [2/1] aa, [2/2] ba, [2/3] bb
Length 3:	[3/0] aba, [3/1] aab, [3/2] aaa, [3/3] baa, [3/4] bab, [3/5] abb, [3/6] bba
Length 4:	[4/0] abaa, [4/1] baab, [4/2] aaba, [4/3] aaaa, [4/4] aaab, [4/5] aabb, [4/6] baaa
Length 5:	[5/0] abaab, [5/1] aabaa, [5/2] abaaa, [5/3] aaaba, [5/4] baabb, [5/5] baaba, [5/6] aaaab
Length 6:	[6/0] aabaab, [6/1] aaabaa, [6/2] abaaaa, [6/3] aaaaba, [6/4] abaabb, [6/5] bbaaba, [6/6] baabba
Length 7:	[7/0] aaabaab, [7/1] aabaabb, [7/2] abaaaaa, [7/3] aaaabaa, [7/4] abaabba, [7/5] aaaaaba, [7/6] bbbaaba

Considering [length 2 / frequency 0] ab=c.

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

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