0 votes
3 views
Let $\Sigma = \{0,1\}$. Show that the problem of determining whether a $CFG$ generates some string in $1^{\ast}$ is decidable. In other words, show that $\{\langle {G \rangle}\mid \text{G is a CFG over {0,1} and } 1^{\ast} \cap L(G) \neq \phi \}$  is a decidable language.
| 3 views

0 votes
0 answers
1
0 votes
0 answers
2
0 votes
0 answers
3
0 votes
0 answers
4