that we have an algorithm to check: given two FAs Mi and M2, 2. Show whether there exists a word x such that is accepted by Mi but not accepted by M2, or r is accepted by M2 but not accepted by M