2 votes 2 votes If L is CFL then $\bar{L}$ is Recursive. ( True/False) If L is CFL then $\bar{L}$ is RE. (True/Flase). Theory of Computation theory-of-computation decidability + – kumar.dilip asked Dec 13, 2018 kumar.dilip 462 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Mk Utkarsh commented Dec 13, 2018 reply Follow Share https://gateoverflow.in/6370/complement-contet-language-recursive-recursive-enumerable 1 votes 1 votes goxul commented Dec 13, 2018 reply Follow Share If L is a CFL, it is also recursive by definition and since recursive languages are closed under complement, L' is also recursive. Same logic for the second one. 1 votes 1 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes Both are True CFL is not closed under Complement but its superset CSL is closed under complement so Recursive and RE. Abhisek Tiwari 4 answered Dec 13, 2018 selected Dec 13, 2018 by Mk Utkarsh Abhisek Tiwari 4 comment Share Follow See all 0 reply Please log in or register to add a comment.