Morphocompletion for #3293 ⟨a, b | abbabbbabba=1⟩

Solved by morph:4/0,3/0. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabbab ⇒ babbaa
2.	abbabbb ⇒ bbbabba
3.	abbbabba ⇒ babbaabb
4.	bbbabbaabba ⇒ 1
5.	abbbbbbabba ⇒ babbaabbbbb
6.	aabbbbbabba ⇒ babbaababbb
7.	abbbbbbbbbabba ⇒ babbaabbbbbbbb
8.	abbbabbbbbabba ⇒ babbaabbbbabbb
9.	aabbbbbbbbabba ⇒ babbaababbbbbb
10.	bbbabbababbaabba ⇒ abbab
11.	bbbabbabbabbaabba ⇒ abbabb
12.	abbbbbbbbbbbbabba ⇒ babbaabbbbbbbbbbb
13.	bbbabbababbababbaabba ⇒ abbababbab
14.	bbbabbabbabbababbaabba ⇒ abbabbabbab
15.	bbbabbababbabbabbaabba ⇒ abbababbabb
	...

Collecting factors up to length 7, frequency 4:

Considering [length 4 / frequency 0] abba=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] bb, [2/1] bc, [2/2] cb, [2/3] cc, [2/4] ab, [2/5] ba, [2/6] ac
Length 3:	[3/0] bbb, [3/1] bbc, [3/2] bcc, [3/3] bcb, [3/4] abb, [3/5] cbc, [3/6] cbb
Length 4:	[4/0] bbbc, [4/1] bbcb, [4/2] bcbc, [4/3] cbcc, [4/4] bbcc, [4/5] abbb, [4/6] bcbb
Length 5:	[5/0] bbbcb, [5/1] bcbcc, [5/2] bcbbc, [5/3] bbcbc, [5/4] cbbcc, [5/5] bbcbb, [5/6] bcbcb

Considering [length 3 / frequency 0] bbb=d.

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

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