Theory of Computation MCQs | Page - 8

Q. 71) ___________ states are called the halt states.

Q. 72) The part of an FA, where the input string is placed before it is run, is called _______

Q. 73) The PDA is called non-deterministic PDA when there are more than one out going edges from……… state

Q. 74) If an effectively solvable problem has answered in yes or no, then this solution is called

Q. 75) The set which is not countable if we have ∑ = {a, b}, is

Q. 76) How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times?

Q. 77) Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is

Q. 78) The set that can be recognized by a deterministic finite state automaton is

Q. 79) What is the reason behind a Turing machine is more powerful than finite state machine FSM?

Q. 80) A pushdown automata behaves like a Turing machine, when it has number of auxiliary/ memory.