0 votes 0 votes Prove that the complement of a context-free language must be recursive. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation proof turing-machine recursive-and-recursively-enumerable-languages + – Rishi yadav asked Mar 16, 2019 Rishi yadav 287 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes CFL is not closed under complement CSL is closed under complement. abhishekmehta4u answered Mar 17, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.