Back to the 2025 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYWhich of the following problems is undecidable? (i) DFA acceptance (ii) NFA acceptance (iii) The Halting Problem (iv) Regular expression matching20242mFormal Language & Automata TheoryRecursively Enumerable languages are also called (i) Turing Recognizable (ii) Turing Decidable (iii) Regular (iv) Context-Free20252mFormal Language & Automata TheoryPumping Lemma for CFLs is used to prove a language is (i) Not Context-Free (ii) Regular (iii) Decidable (iv) Turing recognizable20252mFormal Language & Automata TheoryThe language \{a^mb^nc^{m+n} \mid 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-sensitive20212m
PreviousRecursively Enumerable languages are also called (i) Turing Recognizable (ii) Turing Decidable (iii) Regular (iv) Context-FreeNextWhich of the following is used to prove many undecidability results? (i) Pumping Lemma (ii) Rice's Theorem (iii) Chomsky Normal Form (iv) Subset Construction
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.