The Gateway to Computer Science Excellence
0 votes
11 views
Prove that the complement of a context-free language must be recursive.
in Computer Networks by Boss (11.6k points) | 11 views

1 Answer

0 votes
  • CFL is  not closed under complement

  • CSL is closed under complement.

by Boss (36.5k points)
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,737 questions
57,316 answers
198,360 comments
105,087 users