M

Mr. Dubey • 87.94K Points
Coach 

Q. Consider the following decision problems:
(P1) Does a given finite state machine accept a given string
(P2) Does a given context free grammar generate an infinite number of stings
Which of the following statements is true?

(A) Both (P1) and (P2) are decidable
(B) Neither (P1) nor (P2) are decidable
(C) Only (P1) is decidable
(D) Only (P2) is decidable
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.

Be the first to start discuss.

Related MCQs

Q. How many steps are there in the controlling process?

Q. In XP, as soon as the work on a task is complete, it is integrated into the whole system.

Q. Factors that effect speed of screen reading can be reduced using

Q. A person leaves India permanently on 15-11-2008.The assessment year for income earned till 15-11-2008 in this case shall be:

Q. A free semilattice has the property.

Q. Among the logic families, low power dissipation is in

Q. Different components of the motherboard of a PC unit are linked together by sets of parallel electrical conducting lines. What are these lines called?

Q. Which model in system modelling depicts the dynamic behavior of the system?

Q. How can we convert AO graph with mixed nodes into graph with pure AND and OR nodes?

Q. Which one is not be structured design model ?

Question analytics