Let CCFG = {hG,ki
Chapter , Problem 4.29(choose chapter or problem)
Let CCFG = {hG,ki| G is a CFG and L(G) contains exactly k strings where k 0 or k = }. Show that CCFG is decidable.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer