GATE 1990
Let L be the language generated by the regular expression (0 + 1)* 0011 (0 + 1)*. What is the minimum number of states in a DFA accepting L?
Related Theory of Computation PYQs
The intersection of any context-free language with any regular language is always:
Which class of languages is recognized by a Linear Bounded Automaton (LBA)?
The language L = {a^n b^m a^n b^m | n, m ≥ 1} is:
The language recognized by a non-deterministic Turing machine is:
The grammar S -> a S b | ε generates which language?
Which of the following identities does NOT hold for regular expressions r and s?
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.