M

Mr. Dubey • 100.69K Points
Coach

Q. Which of the following statement is true?

  • (A) All languages can be generated by CFG
  • (B) The number of symbols necessary to simulate a Turing Machine(TM) with m symbols and n states is mn.
  • (C) Any regular languages have an equivalent CFG.
  • (D) The class of CFG is not closed under union.
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Coherent demodulation of FSK signal can be performed using

Q. A basic S-R flip-flop can be constructed by cross-coupling of which basic logic gates?

Q. Which one of the following is NOT the objective of fiscal policy of government of India?

Q. Forward engineering is also known as

Q. In daisy chaining device 0 will pass the signal only if it has

Q. Which of the following is not a type of OSPF packet?

Q. One of the advantage of using a high frequency carrier wave is that it dissipates very small power.

Q. Who invented the inclusion-exclusion principle to solve the Hamiltonian path problem?

Q. According To The Classical Economists, The Economy

Q. How many Hamiltonian paths does the following graph have?

Question analytics