Theory of Computation MCQs | Page - 2
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. Automaton accepting the regular expression of any number of a ' s is:
M
Q. Grammars that can be translated to DFAs:
M
Q. Two strings x and y are indistinguishable if:
M
Q. Given an arbitrary non-deterministic finite automaton NFA with N states, the maximum number of states in an equivalent minimized DFA is at least:
M
Q. The regular expression 0*(10)* denotes the same set as
M
Q. Consider the NFA M shown below. Let the language accepted by M be L. Let L1 be the language accepted by the NFA M1, obtained by changing the accepting state of M to a non-accepting state and by changing the non-accepting state of M to accepting states. Which of the following statements is true?
M
Q. Any given transition graph has an equivalent:
Jump to
Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.
