Home / Engineering / Theory of Computation MCQs / Page 6

# Theory of Computation MCQs | Page - 6

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. 52) Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:

##
Q. 53) Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.

##
Q. 54) The production Grammar is {S->aSbb,S->abb} is

##
Q. 55) Regular expression (x/y)(x/y) denotes the set

##
Q. 56) The regular expression have all strings in which any number of 0’s is followed by any number of 1’s followed by any number of 2’s is :

##
Q. 57) Suppose that a problem A is known to have a polynomial-time verification algorithm. Which of the following statements can be deduced.

##
Q. 58) Which of the following assertions about Turing Machines is true? Blank symbol(s) may occur in the input. At any stage of a computation, there are only finitely many non-blank Symbols on the tape.

##
Q. 59) A PC not connected to a network is equivalent to

##
Q. 60) Recursively enumerable languages are not closed under:

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