Morphocompletion for #3219 ⟨a, b | abaabbabbba=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabbabb ⇒ babbbaa
2.	baabbabb ⇒ bbabbbaa
3.	bbbaabaab ⇒ abbabbbaa
4.	abbabbbaab ⇒ bbabbbaaba
5.	abaabbab ⇒ bbbaabaa
6.	bbabbbaabaa ⇒ 1
7.	bbabbbaabababb ⇒ abbabbbbabbbaa
8.	aabbabbbbabbbaa ⇒ babb
9.	babbbaaabbbaab ⇒ aabbbbabbbaaba
10.	babbbaababbbaabaa ⇒ aabbab
11.	bbabbbaababbbaabaa ⇒ baabbab
12.	baabaabbbbabbbaaba ⇒ abbbaab
	...

Collecting factors up to length 7, frequency 4:

Considering [length 3 / frequency 0] baa=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ccbbbbccb ⇒ bbccbcbbc
2.	bbbccbcbbcccbbccbc ⇒ bbccbcbbbccbcbbccc
3.	cbbbbccbcbbbbbbccbcbbcccbbcc ⇒ bbcc
4.	a ⇒ bbccbc
5.	bbccbba ⇒ 1
6.	ccbbab ⇒ bccbba
7.	bccbbab ⇒ 1
8.	ccbbabb ⇒ 1
9.	bccbbabc ⇒ c
10.	bbabbc ⇒ cbbabb
11.	aa ⇒ ccbbabc
12.	bbabbbccbba ⇒ bbab
13.	acbbabbb ⇒ cbbabbba
	...

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] bb, [2/1] bc, [2/2] cc, [2/3] cb, [2/4] ba, [2/5] ab, [2/6] ac
Length 3:	[3/0] ccb, [3/1] bcc, [3/2] cbb, [3/3] bba, [3/4] bbc, [3/5] bbb, [3/6] bab
Length 4:	[4/0] ccbb, [4/1] bccb, [4/2] bbcc, [4/3] bbab, [4/4] cbba, [4/5] bbbc, [4/6] babb
Length 5:	[5/0] ccbba, [5/1] bbccb, [5/2] bbabb, [5/3] cbbab, [5/4] bccbb, [5/5] bbbcc, [5/6] bccbc

Considering [length 5 / frequency 0] ccbba=d.

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

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