Morphocompletion for #3271 ⟨a, b | abbaaaabaab=1⟩

Solved by morph:5/1,4/0. (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.	aaaabaababb ⇒ 1
5.	bbaaaabaab ⇒ aaabaababb
6.	babbaaaab ⇒ aabaababb
7.	baababba ⇒ abaababb
8.	baaaabaabbbaa ⇒ abbaaabbaaaab
9.	bbaaaabbabba ⇒ abababaababb
10.	aaaabaabababaababb ⇒ aababba
11.	bbaaaabaaabaababb ⇒ ababba
	...

Collecting factors up to length 7, frequency 4:

Considering [length 5 / frequency 1] ababb=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. ababb=c

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] aa, [2/1] ab, [2/2] ca, [2/3] ac, [2/4] ba, [2/5] bb
Length 3:	[3/0] aba, [3/1] caa, [3/2] aaa, [3/3] aca, [3/4] bac, [3/5] aab, [3/6] aac
Length 4:	[4/0] abac, [4/1] caaa, [4/2] acaa, [4/3] baca, [4/4] aaba, [4/5] aaab, [4/6] aaaa
Length 5:	[5/0] caaaa, [5/1] bacaa, [5/2] abaca, [5/3] aaaab, [5/4] aabac, [5/5] acaaa, [5/6] aaaba

Considering [length 4 / frequency 0] abac=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. ababb=c
2. abac=d

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