Home / Engineering / Theory of Computation MCQs / Page 13

# Theory of Computation MCQs | Page - 13

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. 122) TM is more powerful than FSM because

M

##
Q. 123) The symbols that can’t be replaced by anything are called -----------------

M

##
Q. 124) Left hand side of a production in CFG consists of:

M

##
Q. 127) In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called

M

##
Q. 129) If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be generated by Select correct option:

M

##
Q. 130) Which of the following will be used for text searching application-?

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