454 views
1 votes
1 votes
Say that a variable $A$ in $CFL\: G$ is usable if it appears in some derivation of some string $w \in G$. Given a $CFG\: G$ and a variable $A$, consider the problem of testing whether $A$ is usable. Formulate this problem as a language and show that it is decidable.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
admin asked Oct 17, 2019
259 views
Let $C_{CFG} = \{\langle G, k \rangle \mid \text{ G is a CFG and L(G) contains exactly $k$ strings where $k \geq 0$ or $k = \infty$}\}$. Show that $C_{CFG}$ is decidable...
0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3