M

Mr. Dubey • 95.58K 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. A graph is found to be 2 colorable. What can be said about that graph?

Q. As the roll off factor in raised cosine rolloff filter the occupied bandwidth

Q. The resistor which is attached to the service line is called

Q. The TCP/IP layer that is responsible for providing the communication and

Q. Which of the following system does not provision storage to most users ?

Q. Consider the NFA M shown below. Let the language accepted by M be L. Let L1 be the language accepted by the NFA M1, obtained by changing the accepting

Q. _____________ can help us detect poor E-R design.

Q. The full form of CMOS is

Q. What type of fault remains in the system for some period and then disappears?

Q. What is the postfix form of the following prefix expression -A/B*C$DE ?

Question analytics