Let = {0,1}. Show that the problem of determining whether
Chapter , Problem 4.14(choose chapter or problem)
Let = {0,1}. Show that the problem of determining whether a CFG generates some string in 1 is decidable. In other words, show that {hGi| G is a CFG over {0,1} and 1 L(G) 6= }is a decidable language.
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