GATE 2006
Which of the following models of computation is NOT equivalent in computational capability to a standard single-tape Turing machine?
Related Theory of Computation PYQs
Which of the following problems is undecidable?
According to Rice's Theorem, every non-trivial semantic property of the language recognized by a Turing Machine is:
Which of the following classes of languages is accepted by a non-deterministic pushdown automaton (NPDA) by final state?
Consider the language L = {0^n 1^m | n >= 1, m >= 1}. The minimum number of states in a DFA accepting L is
Which of the following operations is NOT closed for Context-Free Languages?
Which of the following problems on regular languages is undecidable?
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.