Morphocompletion for #3109 ⟨a, b | aabbaababba=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	babbaa ⇒ abbaab
2.	baababba ⇒ abbaaabb
3.	baaabbaab ⇒ abbaaabba
4.	baabbaababb ⇒ abbaabbabba
5.	bbaaabbaa ⇒ aabbaabab
6.	aaabbaababb ⇒ 1
7.	baabaabbaabb ⇒ abbaaabbbbaa
8.	baabbaabbbabba ⇒ abbaabbbaababb
9.	abbaaabbbbaaabbaa ⇒ baabab
10.	abbaababbbbaaabbaa ⇒ bbaabab
11.	aaabbaababaabbaabab ⇒ baaabbaa
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] ba, [2/1] aa, [2/2] ab, [2/3] bb
Length 3:	[3/0] baa, [3/1] abb, [3/2] aab, [3/3] bba, [3/4] bab, [3/5] aaa, [3/6] aba
Length 4:	[4/0] bbaa, [4/1] baab, [4/2] abba, [4/3] aabb, [4/4] aaab, [4/5] babb, [4/6] aaba
Length 5:	[5/0] abbaa, [5/1] aabba, [5/2] baaba, [5/3] aaabb, [5/4] bbaab, [5/5] baabb, [5/6] aabab
Length 6:	[6/0] aabbaa, [6/1] abbaab, [6/2] aaabba, [6/3] baabab, [6/4] baabba, [6/5] baaabb, [6/6] aababb
Length 7:	[7/0] aaabbaa, [7/1] aabbaab, [7/2] baababb, [7/3] baabbaa, [7/4] abbaaba, [7/5] bbaabab, [7/6] baaabba

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

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

Rewriting system is complete. See ⟨a, b | aabbaababba=1⟩.