Theory of Computation MCQs | Page - 4

Q. 31) Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then

Q. 32) Which of the following statement is wrong?

Q. 33) Grammar that produce more than one Parse tree for same sentence is:

Q. 34) The language accepted by a Push down Automata:

Q. 35) The PDA is called non-deterministic PDA when there are more than one out going edges from……… state:

Q. 36) 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 :

Q. 37) 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:

Q. 38) 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?

Q. 39) Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression

Q. 40) 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?