1
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Consider the following decision problems:
$${P_1}$$ Does a given finite state machine accept a given string
$${P_2}$$ Does a given context free grammar generate an infinite number of stings.

Which of the following statements is true?

A
Both $${P_1}$$ and $${P_2}$$ are decidable
B
Neither $${P_1}$$ and $${P_2}$$ are decidable
C
Only $${P_1}$$ is decidable
D
Only $${P_2}$$ is decidable
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12