Home / Engineering / Theory of Computation MCQs / Page 11

# Theory of Computation MCQs | Page - 11

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.

M

##
Q. 101) Which of the following problem is undecidable?

M

##
Q. 103) Consider the following problem x. Given a Turing machine M over the input alphabet Σ, any state q of M. And a word w Є Σ*, does the computation of M on w visit the state q? Which of the following statements about x is correct?

M

##
Q. 104) If a language is denoted by a regular expression L = ( x )* (x y x ), then which of the following is not a legal string within L ?

M

##
Q. 105) Given A = {0,1} and L = A*. If R = (0n1n, n > 0), then language L ∪ R and R are respectively

M

##
Q. 106) If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?

M

##
Q. 107) The logic of pumping lemma is a good example of

M

##
Q. 108) For two regular languages L1 = (a + b)* a and L2 = b (a + b ) *, the intersection of L1 and L2 is given by

M

##
Q. 109) Pumping lemma is generally used for proving that

M

##
Q. 110) What is the highest type number which can be applied to the following grammar? S —>Aa, A —> Ba, B —>abc

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