M

Mr. Dubey • 95.67K Points
Coach

Q. Consider the following statements
I. Recursive languages are closed under complementation
II. Recursively enumerable languages are closed under union
III. Recursively enumerable languages are closed under complementation
Which of the above statement are TRUE?

  • (A) I only
  • (B) I and II
  • (C) I and III
  • (D) II and III
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. __________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.

Q. The device which starts data transfer is called

Q. In Naive Bayes equation P(C / X)= (P(X / C) *P(C) ) / P(X) which part considers "likelihood"?

Q. A process can enter into its critical section ____________

Q. Which option is true regarding the carry in the ripple adders?

Q. Which of the following statement is incorrect regarding the Class-responsibility-collaborator (CRC) modeling ?

Q. SOM was developed during .

Q. which one of the following monitors has an electron gun

Q. permission to access the file is controlled by

Q. _______ mining is concerned with discovering the model underlying the link structures of the web.

Question analytics