Morphocompletion for #2049 ⟨a, b | ababaaab=aa⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	ababaaab ⇒ aa
2.	aaabaaab ⇒ ababaaaa
3.	ababababaaaa ⇒ aaaaab
4.	ababaaaaaaab ⇒ aaabababaaaa
5.	aaaaabbabaaab ⇒ aaaaaba
6.	aaaaabaabaaab ⇒ aaaaabbabaaaa
7.	aaaaababbabaaab ⇒ aaaaababa
8.	ababababaababaaaa ⇒ aaaaabbaaab
9.	aaaaabaabbabaaab ⇒ aaaaabaaba
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] aa, [2/1] ab, [2/2] ba, [2/3] bb
Length 3:	[3/0] aaa, [3/1] aba, [3/2] aab, [3/3] bab, [3/4] baa, [3/5] abb, [3/6] bba
Length 4:	[4/0] aaaa, [4/1] aaab, [4/2] abab, [4/3] abaa, [4/4] baba, [4/5] baaa, [4/6] aaba
Length 5:	[5/0] ababa, [5/1] baaab, [5/2] aaaaa, [5/3] abaaa, [5/4] babaa, [5/5] aaaab, [5/6] aaaba
Length 6:	[6/0] abaaab, [6/1] aaaaab, [6/2] ababaa, [6/3] babaaa, [6/4] ababab, [6/5] abaaaa, [6/6] aaabaa
Length 7:	[7/0] babaaab, [7/1] aaaaaba, [7/2] ababaaa, [7/3] abababa, [7/4] babaaaa, [7/5] aabaaab, [7/6] abbabaa

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

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

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