0 votes 0 votes Let $C = \{ \langle G, x \rangle \mid \text{G is a CFG $x$ is a substring of some $y \in L(G)$}\}$. Show that $C$ is decidable. (Hint: An elegant solution to this problem uses the decider for $E_{CFG}$.) Theory of Computation michael-sipser theory-of-computation context-free-grammar decidability proof + – admin asked Oct 17, 2019 admin 177 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.