Morphocompletion for #3074 ⟨a, b | aababbaaaab=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	baaaabaaba ⇒ aaaabaabab
2.	abbaaaaba ⇒ baaaabaab
3.	ababbaa ⇒ bbaaaab
4.	aababbaa ⇒ abbaaaab
5.	aaaabaababb ⇒ 1
6.	bbaaaabaab ⇒ aaabaababb
7.	babbaaaab ⇒ aabaababb
8.	baababba ⇒ abaababb
9.	aaaabaababababbaa ⇒ baaaab
10.	aaaabaabababaababb ⇒ aababba
11.	bbaaaabaaabaababb ⇒ ababba
	...

Collecting factors up to length 7, frequency 4:

Considering [length 4 / frequency 1] babb=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] aa, [2/1] ba, [2/2] ac, [2/3] ab, [2/4] ca, [2/5] cb, [2/6] bc
Length 3:	[3/0] aaa, [3/1] aac, [3/2] bab, [3/3] baa, [3/4] aca, [3/5] aba, [3/6] aab
Length 4:	[4/0] baac, [4/1] aaaa, [4/2] baba, [4/3] caaa, [4/4] acaa, [4/5] aaac, [4/6] abaa
Length 5:	[5/0] abaac, [5/1] caaaa, [5/2] acaaa, [5/3] aaaac, [5/4] babaa, [5/5] aaaab, [5/6] aabaa

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

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

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