edited by
180 views

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
3
admin asked Oct 17, 2019
252 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
4