List of top Computer Science & Information Technology Questions on Theory of Computations asked in GATE CS

Let a Non-deterministic Finite Automaton (NFA) have 6 states over a finite alphabet. Which of the following cannot be the number of states in a minimal Deterministic Finite Automaton (DFA) that is equivalent to this NFA?

Which ONE of the following languages is accepted by a deterministic pushdown automaton?

For $\Sigma = \{a,b\}$, let us consider the regular language $L = \{x \mid x = a^{2+3k} \text{ or } x = b^{10+12k},\; k \ge 0\}$. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for $L$?