Morphocompletion for #12635 ⟨a, b | babb=ab, bbbb=b⟩

Solved by morph:2/0. (See Morphocompletion.)

Step 1

Checking up to 80 rules for overlaps.

Rewriting system is not complete: stepTotalLimit

#	Rule
1.	bbbb ⇒ b
2.	bbbab ⇒ ab
3.	abb ⇒ bbab
4.	bbbaab ⇒ aab
5.	abab ⇒ bbaab
6.	bbbaaab ⇒ aaab
7.	abaab ⇒ bbaaab
8.	bbbaaaab ⇒ aaaab
9.	abaaab ⇒ bbaaaab
10.	bbbaaaaab ⇒ aaaaab
11.	abaaaab ⇒ bbaaaaab
12.	bbbaaaaaab ⇒ aaaaaab
13.	abaaaaab ⇒ bbaaaaaab
14.	bbbaaaaaaab ⇒ aaaaaaab
15.	abaaaaaab ⇒ bbaaaaaaab
16.	bbbaaaaaaaab ⇒ aaaaaaaab
17.	abaaaaaaab ⇒ bbaaaaaaaab
18.	bbbaaaaaaaaab ⇒ aaaaaaaaab
19.	abaaaaaaaab ⇒ bbaaaaaaaaab
20.	bbbaaaaaaaaaab ⇒ aaaaaaaaaab
21.	abaaaaaaaaab ⇒ bbaaaaaaaaaab
22.	bbbaaaaaaaaaaab ⇒ aaaaaaaaaaab
23.	abaaaaaaaaaab ⇒ bbaaaaaaaaaaab
	...

Collecting factors up to length 14, frequency 2:

Length 2:	[2/0] ab, [2/1] bb
Length 3:	[3/0] aab, [3/1] aaa
Length 4:	[4/0] aaab, [4/1] aaaa
Length 5:	[5/0] aaaab, [5/1] aaaaa
Length 6:	[6/0] aaaaab, [6/1] aaaaaa
Length 7:	[7/0] aaaaaab, [7/1] aaaaaaa
Length 8:	[8/0] aaaaaaab, [8/1] bbbaaaaa
Length 9:	[9/0] aaaaaaaab, [9/1] bbbaaaaaa
Length 10:	[10/0] aaaaaaaaab, [10/1] bbbaaaaaaa
Length 11:	[11/0] aaaaaaaaaab, [11/1] bbbaaaaaaaa
Length 12:	[12/0] aaaaaaaaaaab, [12/1] bbaaaaaaaaab
Length 13:	[13/0] bbaaaaaaaaaab, [13/1] baaaaaaaaaaab

Considering [length 2 / frequency 0] ab=c.

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

Rewriting system is complete. See ⟨a, b | babb=ab, bbbb=b⟩.