M

Mr. Dubey • 100.69K Points
Coach

Q. Which of the following problems are decidable?
1) Does a given program ever produce an output?
2) If L is a context-free language, then is L’ (complement of L) also context-free?
3) If L is a regular language, then is L’ also regular?
4) If L is a recursive language, then, is L’ also recursive?

  • (A) 1, 2, 3, 4
  • (B) 1, 2
  • (C) 2, 3, 4
  • (D) 3, 4
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. Give an example for a long budget.

Q. The availability of ____________ made the wireless communication popular among the masses.

Q. Enrichment is

Q. Two 4-bit comparators are cascaded to form an 8-bit comparator. The cascading inputs of the most significant 4 bits should be connected .

Q. A COCOMO model is

Q. Financial activities done by bank is called _____.

Q. The UNION SQL clause can be used with _____________

Q. RAD stands for

Q. Which of the following are participants in the GOF builder design pattern?

Q. Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.

Question analytics