Multiple Choice
Which of the following statements is/are FALSE?
(1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
(2) Turing recognizable languages are closed under union and complementation.
(3) Turing decidable languages are closed under intersection and complementation
(4) Turing recognizable languages are closed under union and intersection.
A) 1 and 4 only
B) 1 and 3 only
C) 2 only
D) 3 only
Correct Answer:
Verified
Correct Answer:
Verified
Q40: The PDA is called non-deterministic PDA when
Q41: FSM can recognize<br>A)Any grammar<br>B)Only CG<br>C)Both (a) and
Q42: Consider the following Finite State Automaton The
Q43: PCP is:<br>A)Decidable<br>B)Undecidable<br>C)Sometimes Decidable<br>D)None of the
Q44: Which one of the following is true
Q45: Recursively enumerable languages are not closed under<br>A)Union<br>B)homomorphism<br>C)complementation<br>D)concatenation
Q46: Given A = {0,1} and L =
Q47: A minimum state deterministic finite automation accepting
Q48: Let L={w (0 + 1)* w has
Q50: Which of the following are decidable?<br>1) Whether