theory of computation

P = {(M) | M is a DFA over {a,b) and L(M)0) P2 MM is a DFA over a, b and L(M) 1 P3-1(M) I M is a DFA over {a,b) and L(M) s finite) P-f(Af) | M is a DFA over(a, b} and abe L(M)) = {(M, M') | M and M, are both DFA over {a,b) and L(M)(M)) = {(M. M') | M and M, are both DFA over {a,b) and L(M) L(M')} (a) For the DFA M with the given state diagram, list all and only P such that (M) E P (where 1