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.

Mr. Dubey • 51.17K Points
Coach

Q. 121) Which statement is true?

(A) The PDA must have one accept state and one reject state

(B) The PDA must have one accept state and two reject state

(D) There is no reject state in the PDA.

View Answer Discuss Share

Mr. Dubey • 51.17K Points
Coach

Q. 122) TM is more powerful than FSM because

(A) The tape movement is confined to one direction

(B) It has no finite state control

(D) None of these

View Answer Discuss Share

Mr. Dubey • 51.17K Points
Coach

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

(A) Productions

(B) Terminals

(D) All of above

View Answer Discuss Share

Mr. Dubey • 51.17K Points
Coach

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

(A) One terminal

(B) More than one terminal

(D) Terminals and non-terminals

View Answer Discuss Share

Mr. Dubey • 51.17K Points
Coach

Q. 125) Choose the incorrect statement:

(A) (a+b)aa(a+b)generates Regular language.

(B) A language consisting of all strings over ∑={a,b} having equal number of a’s and b’s is a regular language

(D) None of these

View Answer Discuss Share

Mr. Dubey • 51.17K Points
Coach

Q. 126) Choose the incorrect statement.

(A) A Mealy machine generates no language as such

(B) A Mealy machine has no terminal state

(C) For a given input string, length of the output string generated by a Moore machine is not more than the length of the output string generated by that of a Mealy machine

(D) All of these

View Answer Discuss Share

Mr. Dubey • 51.17K Points
Coach

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

(A) Dead State

(B) Waste Basket

(D) All of these

View Answer Discuss Share

Mr. Dubey • 51.17K Points
Coach

Q. 128) Which statement is true?

(A) The tape of turing machine is infinite.

(B) The tape of turing machine is finite.

(D) The tape of turing machine is finite when the language is nonregular.

View Answer Discuss Share

Mr. Dubey • 51.17K Points
Coach

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

(A) (r1)(r2)

(B) (r1 + r2)

(D) (r1)

View Answer Discuss Share

Mr. Dubey • 51.17K Points
Coach

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

(A) NFA

(B) DFA

(D) None of these

View Answer Discuss Share

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

Theory of Computation MCQs Set 14

Theory of Computation MCQs Set 15

Explore More Categories

Click on category to learn MCQs of that category.

Biotechnology Engineering

Chemical Engineering

Civil Engineering

Computer Science Engineering

Electrical Engineering

Electronics and Communication Engineering

Information Technology Engineering (IT)

Mechanical Engineering

Production Engineering

Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.

Programming Questions

Advance Search

Shop

Duo Test