# Peter Linz Edition 5 Exercise 11.1 Question 11 (Page No. 284)

0 votes
72 views
Prove that the complement of a context-free language must be recursive.

0 votes

## Related questions

0 votes
2 answers
1
70 views
Let $L_1$ be recursive and $L_2$ recursively enumerable. Show that $L_2-L_1$ is necessarily recursively enumerable.
1 vote
1 answer
2
57 views
Is the family of recursive languages closed under concatenation$?$
0 votes
0 answers
3
53 views
Show that the families of recursively enumerable and recursive languages are closed under reversal.
0 votes
0 answers
4
30 views
Show that the family of recursive languages is closed under union and intersection.