Intermediate
Theory of Computation
Q48 / 100
What is the emptiness problem for CFGs?
Correct! Well done.
Incorrect.
The correct answer is B) Determining if a CFG generates no strings — decidable
B
Correct Answer
Determining if a CFG generates no strings — decidable
Explanation
The emptiness problem for CFGs is decidable: mark productive non-terminals (those deriving terminal strings), and check if S is marked. Equivalence is undecidable for CFGs.
Progress
48/100