Q. Automaton accepting the regular expression of any number of a ' s is:
β
Correct Answer: (A)
a*
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.
Q. Grammars that can be translated to DFAs:
β
Correct Answer: (B)
Right linear grammar
Q. Two strings x and y are indistinguishable if:
β
Correct Answer: (C)
Both above statements are true
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:
β
Correct Answer: (C)
2N
Q. Regular expressions are
β
Correct Answer: (A)
Type 0 language
Q. The regular expression 0*(10)* denotes the same set as
β
Correct Answer: (B)
0+(0+10)*
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?
β
Correct Answer: (A)
L1 = {0,1}* − L
Q. Which of the statements is true:
β
Correct Answer: (C)
Both of the above are true statements
Q. The regular sets are closed under:
β
Correct Answer: (D)
All of the above
Q. Any given transition graph has an equivalent:
β
Correct Answer: (D)
All of them
Jump to