GATE 1991
How many states are present in the minimal DFA that accepts all binary strings of length at most 2?
Related Theory of Computation PYQs
The problem of determining whether an arbitrary context-sensitive grammar generates any words (emptiness problem for CSGs) is:
Let L be the set of all binary strings where the number of 0s is equal to the number of 1s. L is:
Let Σ = {a, b}. The language L = {a^n b^m | n ≥ 0, m ≥ 0, and n + m ≤ 10} is:
The language L = {a^n b^n | n ≥ 1} is not regular. This can be formally proven using:
What is the minimum number of states in a DFA that accepts all strings over {0, 1} ending with '010'?
Which of the following languages over {a, b} is regular?
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.