0 votes 0 votes 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. Theory of Computation michael-sipser theory-of-computation context-free-grammar decidability proof + – admin asked Oct 17, 2019 admin 252 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.