GATE 1992
What is the minimum number of states in a DFA over alphabet {a, b} accepting the language L = {w | w contains an even number of 'a's and ends with 'b'}?
Related Theory of Computation PYQs
What is the minimum number of states in a DFA accepting the language L = {w ∈ {a, b}* | w contains both 'aa' and 'bb' as substring…
Which of the following statements is TRUE about deterministic context-free languages (DCFLs)?
Which of the following statements about Chomsky Normal Form (CNF) is TRUE?
What is the minimum number of states in a DFA accepting the language L = {w ∈ {0, 1}* | w contains an odd number of 1s}?
Which of the following languages is context-free?
What is the minimum number of states in a DFA accepting the language L = {w ∈ {0, 1}* | w starts with '1' and ends with '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.