Consider the formal problem:
Given a context-free grammar $G$, is the language $L(G)$ empty?
Can we determine if the problem is recursively enumerable, recursive, in NP, or in P? Can the entire procedure be explained?
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community