Back to the 2025 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYRecursive languages are: (i) a proper superset of CFLs (ii) always recognizable (iii) also called type-0 languages (iv) recognizable by Turing machines20232mFORMAL LANGUAGE & AUTOMATA THEORYA language is said to be recursively enumerable if it is accepted by a (i) DFA (ii) Turing Machine (iii) PDA (iv) Linear Bounded Automaton20252mFORMAL LANGUAGE & AUTOMATA THEORYA recursively enumerable language L is recursive if: (i) L' is recursively enumerable (ii) every sequence of moves of T halts (iii) Both (i) and (ii) (iv) None of the above20222mFormal Language & Automata TheoryThe Halting Problem is (i) Decidable (ii) Undecidable (iii) Context-Free (iv) Regular20252m
PreviousWhich of the following requires context sensitivity? (i) a^n b^n (ii) a^n b^n c^n (iii) (a+b)^* (iv) a^*NextThe Halting Problem is (i) Decidable (ii) Undecidable (iii) Context-Free (iv) Regular
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.