Q. Which statement is true?
✅ Correct Answer: (D)
There is no reject state in the PDA.
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.
Q. TM is more powerful than FSM because
✅ Correct Answer: (B)
It has no finite state control
Q. The symbols that can’t be replaced by anything are called -----------------
✅ Correct Answer: (B)
Terminals
Q. Left hand side of a production in CFG consists of:
✅ Correct Answer: (D)
Terminals and non-terminals
Q. Choose the incorrect statement:
✅ Correct Answer: (D)
None of these
Q. Choose the incorrect statement.
✅ Correct Answer: (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
Q. In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called
✅ Correct Answer: (D)
All of these
Q. Which statement is true?
✅ Correct Answer: (A)
The tape of turing machine is infinite.
Q. If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be generated by Select correct option:
✅ Correct Answer: (A)
(r1)(r2)
Q. Which of the following will be used for text searching application-?
✅ Correct Answer: (C)
PDA
Jump to