GATE 2018
Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessarily true?
Related Theory of Computation PYQs
Consider the following languages: I. { a^m b^n c^p d^q | m + p = n + q, where m, n, p, q >= 0 } II. { a^m b^n c^p d^q | m = n and …
Consider the following problems. L(G) denotes the language generated by grammar G. L(M) denotes the language accepted by machine M…
Given a language L, define L^0 = {ε}, L^i = L^(i-1) L. The order of language L is the smallest k such that L^k = L^(k+1). For lang…
The set of all recursively enumerable languages is:
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 …
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.