Computer science: Theory Of computation MCQs

Which of the following is/are undecidable?
1. G is a CFG. Is L (G) = Φ?
2. G is a CFG. IS L (G) =∑ * ?
3. M is a Turning machine. Is L(M) regular?
4. A is a DFA and N is a NFA. Is L (A) = L (N) ?

Consider the DFA given below.

Which of the following are FALSE?

1. Complement of L(A) is context–free
2. L (A) = L ((11 * 0 + 0) (0 + 1) * 0 *1 *)
3. For the language accepted by A, A is the minimal DFA
4. A accepts all strings over {0, 1} of length at least 2

Consider the following languages
L1= {0p1q0r|p,q,r>=0}

L2= {0p1q0r|p,q,r>=0 and p!=r}
Which one of the following statements is FALSE?

What is the complement of the language accepted by the NFA shown below?
Assume ∑ = {a} and ε is the empty string.

Which of the following problems are decidable?
1) Does a given program ever produce an output?
2) If L is a context-free language, then, is L’ also context-free?
3) If L is a regular language, then, is L’ also regular?
4) If L is a recursive language, then, is L’ also recursive?