GATE 2023 · CS - Forenoon
Related Theory of Computation PYQs
Consider the context-free grammar G below S → aSb | X X → aX | Xb | a | b, where S and X are non-terminals, and a and b are termin…
Consider the pushdown automaton (PDA) P below, which runs on the input alphabet {a,b}, has stack alphabet {bottom-marker, A}, and …
Consider the language L over the alphabet {0,1}, given below: L = {w in {0,1}* | w does not contain three or more consecutive 1's}…
Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet {0,1}, and has the set of stat…
Consider the pushdown automaton (PDA) P below, which runs on the input alphabet {a,b}, has stack alphabet {⊥,A}, and has three sta…
Consider the following grammar where S is the start symbol, and a and b are terminal symbols. S → aSbS | bS | ε Which of the follo…
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.