List of top Computer Science & Information Technology Questions on Theory of Computations

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$?

Consider the grammar $S \rightarrow aSa \mid bSb \mid a \mid b$. Which one of the following options correctly characterizes the language generated by the given grammar over the alphabet {a,b} 
 

To prove that a problem $\chi$ in NP is NP-complete, it would be sufficient to show which one of the following to be true?
Which one of the following problems is undecidable?
For a machine to surpass all the letters of alphabets excluding vowels, how many states in DFA would be required?
Moore machine is an example of
A language $L$ is said to be Turing machine (TM) decidable if
A Turing machine that is able to simulate other Turing machines is known as
Choose the correct option when
S1: Initial state of NFA is initial state of DFA
S2: The final state of DFA will be every combination of final set of NFA
Which of the following does not represent the language $\{0, 01\}$?
How many tuples are present in finite state machine?
According to the Chomsky classification, language of finite automata is
What is the regular expression for all strings starting with ab then any number of a or b and ending with bba?
The transition a pushdown automation made by is additionally dependent upon