Home / Engineering / Theory of Computation MCQs / Page 8

# Theory of Computation MCQs | Page - 8

Dear candidates you will find MCQ questions of Theory of Computation here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

##
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.

### Explore Sets

Theory of Computation MCQs Set 1

Theory of Computation MCQs Set 2

Theory of Computation MCQs Set 3

Theory of Computation MCQs Set 4

Theory of Computation MCQs Set 5

Theory of Computation MCQs Set 6

Theory of Computation MCQs Set 7

Theory of Computation MCQs Set 8

Theory of Computation MCQs Set 9

Theory of Computation MCQs Set 10

Theory of Computation MCQs Set 11

Theory of Computation MCQs Set 12

Theory of Computation MCQs Set 13

### Explore More Categories

Click on category to learn MCQs of that category.Electronics and Communication Engineering