in Theory of Computation
153 views
0 votes
0 votes
Show that the complement of the language $L =$ {$a^nb^mc^k : k = n + m$} is context-free.
in Theory of Computation
153 views

Please log in or register to answer this question.

Related questions