Q. Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then
✅ Correct Answer: (D)
L1=L2
Theory of Computation MCQs | Page - 4
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. Which of the following statement is wrong?
✅ Correct Answer: (D)
All languages can be generated by context- free grammar
Q. Grammar that produce more than one Parse tree for same sentence is:
✅ Correct Answer: (A)
Ambiguous
Q. The language accepted by a Push down Automata:
✅ Correct Answer: (C)
Type 2
Q. The PDA is called non-deterministic PDA when there are more than one out going edges from……… state:
✅ Correct Answer: (C)
READ or POP
Q. Let L be a language defined over an alphabet ∑,then the language of strings , defined over ∑, not belonging to L denoted by LC or L. is called :
✅ Correct Answer: (B)
Complement of the language L
Q. All NonNull words of the CFL can be generated by the corresponding CFG which is in CNF i.e the grammar in CNF will generate the same language except the:
✅ Correct Answer: (C)
Null string
Q. Let L={w (0 + 1)* w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?
✅ Correct Answer: (B)
0*(10*10*)*
Q. Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression
✅ Correct Answer: (C)
b*a(a+b)*
Q. Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?
✅ Correct Answer: (B)
L1-L3 is recursively enumerable
Jump to