Morphocompletion for #3046 ⟨a, b | aabaabbabba=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	baabbabba ⇒ abaabbabb
2.	babbaaab ⇒ aabbabba
3.	bbabbaaa ⇒ abaabbab
4.	bbaaabaa ⇒ aabaabba
5.	aaabaabbabb ⇒ 1
6.	baaabaabba ⇒ aaabaabbab
7.	baabbababaabbabb ⇒ aabaabbabbbbabba
8.	baabbabaabaabbabb ⇒ aabaabbabbbbabbaa
9.	aaabaabbababaabbab ⇒ babbaaa
10.	aaabaabbabaabaabba ⇒ baaabaa
	...

Collecting factors up to length 7, frequency 4:

Considering [length 6 / frequency 0] baabba=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] bc, [2/1] ac, [2/2] aa, [2/3] cb, [2/4] ba, [2/5] bb, [2/6] ca
Length 3:	[3/0] acb, [3/1] cbc, [3/2] baa, [3/3] aac, [3/4] cbb, [3/5] aaa, [3/6] cac
Length 4:	[4/0] acbc, [4/1] aacb, [4/2] acbb, [4/3] baaa, [4/4] aaac, [4/5] cacb, [4/6] bcaa
Length 5:	[5/0] aaacb, [5/1] baaac, [5/2] aacbb, [5/3] cacbc, [5/4] bcaac, [5/5] aacbc, [5/6] bacbb

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

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

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