Show that the problem of determining whether a CFG generates all strings in 1 * is decidable.

Question:

Show that the problem of determining whether a CFG generates all strings in 1* is decidable. In other words, show that {〈G〉| G is a CFG over {0,1} and 1* ⊆ L(G)} is a decidable language.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: