Back to the 2022 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYFrom the options, the pair having different expressive powers is: (i) DPDA and NPDA (ii) DFA and NFA (iii) single-tape TM and multi-tape TM (iv) deterministic single-tape TM and nondeterministic single-tape TM20232mFormal 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 THEORYMulti-tape TM is (i) More powerful than single-tape TM (ii) Less powerful (iii) Equivalent in power (iv) Not equivalent20252m
PreviousThe language \{ a^m b^n c^{m+n} / m, n \ge 1 \} is (i) regular (ii) context-free but not regular (iii) Context-sensitive but not context free (iv) type-0 but not context sensitiveNextThe logic of pumping lemma is a good example of (i) pigeon-hole principle (ii) divide-and-conquer technique (iii) recursion (iv) iteration