GATE 2013
Related Theory of Computation PYQs
Which of the following is/are undecidable? 1. G is a CFG. Is L(G) = ϕ? 2. G is a CFG. Is L(G) = Σ*? 3. M is a Turing machine. Is L…
Which of the following statements is/are FALSE? 1. For every non-deterministic Turing machine, there exists an equivalent determin…
Which of the following languages is NOT regular?
Consider the following deterministic finite automaton (DFA) over the alphabet {0, 1} with states {q0, q1, q2}, where q0 is the sta…
The language L = {a^n b^m c^m d^n | n, m >= 1} is:
Consider the languages L₁=∅ and L₂={a}. Which one of the following represents L₁L₂* ∪ L₁*?
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.