Question 1
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.
Question 2
Question 5
Question 6
Question 7
Question 8
L1\' --> Complement of L1 L2\' --> Complement of L2
Question 9
S1 : L1 is recursive implies L2 is recursive S2 : L2 is recursive implies L1 is recursiveWhich of the following statements is true ?
Question 10
There are 29 questions to complete.