Theory of Computation MCQs | Page - 6

Q. 51) Consider the following statements about the context free grammar G = {S - >SS,S - >ab,S ->ba, S - ε}
I. G is ambiguous
II. G produces all strings with equal number of a’s and b’s
III. G can be accepted by a deterministic PDA.
Which combination below expresses all the true statements about G?

Q. 52) Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:

Q. 53) Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.

Q. 54) The production Grammar is {S->aSbb,S->abb} is

Q. 55) Regular expression (x/y)(x/y) denotes the set

Q. 56) The regular expression have all strings in which any number of 0’s is followed by any number of 1’s followed by any number of 2’s is :

Q. 57) Suppose that a problem A is known to have a polynomial-time verification algorithm. Which of the following statements can be deduced.

Q. 58) Which of the following assertions about Turing Machines is true? Blank symbol(s) may occur in the input. At any stage of a computation, there are only finitely many non-blank Symbols on the tape.

Q. 59) A PC not connected to a network is equivalent to

Q. 60) Recursively enumerable languages are not closed under: