Morphocompletion for #3421 ⟨a, b, c | ba=ab, abc=c⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	bac ⇒ c
2.	baac ⇒ ac
3.	baaac ⇒ aac
4.	baaaac ⇒ aaac
5.	baaaaac ⇒ aaaac
6.	baaaaaac ⇒ aaaaac
7.	baaaaaaac ⇒ aaaaaac
8.	baaaaaaaac ⇒ aaaaaaac
9.	baaaaaaaaac ⇒ aaaaaaaac
10.	baaaaaaaaaac ⇒ aaaaaaaaac
11.	baaaaaaaaaaac ⇒ aaaaaaaaaac
12.	baaaaaaaaaaaac ⇒ aaaaaaaaaaac
13.	baaaaaaaaaaaaac ⇒ aaaaaaaaaaaac
14.	baaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaac
15.	baaaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaaac
16.	baaaaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaaaac
17.	baaaaaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaaaaac
18.	baaaaaaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaaaaaac
19.	baaaaaaaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaaaaaaac
20.	ab ⇒ ba
	...

Collecting factors up to length 4 / frequency 7:

Considering [length 2 / frequency 1] ba=d.

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

Rewriting system is complete. See ⟨a, b, c | ba=ab, abc=c⟩.