Back to the 2021 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYWhich of the following statements is/are false? A. For every nondeterministic TM, an equivalent deterministic TM exists. B. Turing recognizable languages are closed under union and complementation. C. Turing decidable languages are closed under intersection and complementation. D. Turing recognizable languages are closed under union and intersection. (i) A and D only (ii) A and C only (iii) B only (iv) C only20212mFormal Language & Automata TheoryA language accepted by deterministic pushdown automata is closed under which of the following? (i) Complement (ii) Union (iii) Both (i) and (ii) (iv) None of the above20202mFORMAL LANGUAGE & AUTOMATA THEORYA language accepted by deterministic pushdown automata is closed under which of the following? (i) Complement (ii) Union (iii) Both (i) and (ii) (iv) None of the above20232mFormal Language & Automata TheoryA language L may not be accepted by a turing machine if (i) it is recursively enumerable (ii) it is recursive (iii) L can be enumerated by some turing machine (iv) None of the above20202m