M

Mr. Dubey • 97.86K Points
Coach

Q. Which of the following statement is false for a turing machine?

  • (A) There exists an equivalent deterministic turing machine for every nondeterministic turing machine
  • (B) Turing decidable languages are closed under intersection and complementation
  • (C) Turing recognizable languages are closed under union and intersection
  • (D) Turing recognizable languages are closed under union and complementation
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. EC stands for?

Q. It is one principal of testing is that Exhausting Testing is…..

Q. Let S and T be language over ={a,b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is true?

Q. In Centralised IT management system decision making is

Q. Management should find ' One best way ' to perform a task. Which technique of scientific management is defined in this sentence?

Q. Which command is used to display the contents of the text file of DOS?

Q. The DoS attack is which the attacker sends deluge of packets to the targeted host

Q. Select the interaction that the use case description has.

Q. is used to create the organisation's overall security program.

Q. ,-4), 2,7)

Question analytics