GATE 2007
Let L be the language recognized by an NFA with 4 states. What is the maximum number of states in the equivalent minimal DFA?
Related Theory of Computation PYQs
Which of the following are decidable? I. Whether the intersection of two regular languages is infinite II. Whether a given context…
The language L={ 0i 21i ∣ i≥0 } over the alphabet {0,1,2} is:
Every regular language is context-free, but context-free languages are NOT closed under:
Which of the following problems is known to be decidable?
Consider the context-free language L = {w w^R | w in {a, b}*}. Which of the following is TRUE?
What is the minimum number of states in a DFA accepting the language L = {w in {a, b}* | |w| mod 2 == 0 and |w| mod 3 == 0}?
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.