edited by
450 views

1 Answer

Best answer
3 votes
3 votes
Yes, you can get a complement of language which is cfl but not regular as CFL.

L={a^nb^n | n>=0} this is a cfl which is not regular.Now it’s complement L’ ={a^mb^n | m!=n} this is also a cfl.

CFL’s are not closed under complementation. The complement of a CFL may or may not be CFL.
selected by

Related questions

5 votes
5 votes
2 answers
2
Pradip Nichite asked Dec 31, 2015
4,762 views
Please some one explain. why complement of this language is CFL.
8 votes
8 votes
3 answers
4
Payal Rastogi asked Nov 2, 2015
7,125 views
The complement of the language $L$ containing an equal number of $a's$,$b's$ and $c's$ is (a) regular(b) context free(c) context sensitive but not context free(d) recursi...