GATE 1998
Related Theory of Computation PYQs
Which of the following problems on Context-Free Languages is DECIDABLE?
Consider the following grammar where S is the start symbol, and a and b are terminal symbols. S → aSbS | bS | ε Which of the follo…
Let M be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of the following options CANNOT be …
Let L1 and L2 be two languages over a finite alphabet, such that L1 intersect L2 and L2 are regular languages. Which of the follow…
Consider the following context-free grammar G. S → abaABAbba A → aaBBAb | bBabaa B → aBb | ab In the above grammar, S is the start…
Which one of the following statements is equivalent to the following assertion? Turing machine M decides the language L subset of …
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.