The Gateway to Computer Science Excellence
0 votes
6 views
Show that the complement of the language $L =$ {$a^nb^mc^k : k = n + m$} is context-free.
in Theory of Computation by Boss (15.1k points) | 6 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,167 answers
193,838 comments
94,000 users