2 votes 2 votes Which of the following statements is false? Every context-sensitive language is recursive The set of all languages that are not recursively enumerable is countable The family of recursively enumerable language is closed under union The families of recursively enumerable and recursive languages are closed under reversal Theory of Computation ugcnetcse-jan2017-paper3 theory-of-computation recursive-and-recursively-enumerable-languages + – go_editor asked Feb 1, 2017 recategorized Jun 25, 2022 by Lakshman Bhaiya go_editor 3.7k views answer comment Share Follow See 1 comment See all 1 1 comment reply Deepak Poonia commented Sep 25, 2023 reply Follow Share Detailed Video Solution: https://www.youtube.com/watch?v=fl8Z3oM2EJk&t=8506s Countability Complete Course, with Proofs, Variations & All type of questions covered: https://youtube.com/playlist?list=PLIPZ2_p3RNHgXosiQv-gL1PvJkcHokW1p&feature=shared 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes Option B) A - CSL is a subset of recursive languages C and D are their respective closure properties. Kaushik.P.E answered Feb 1, 2017 selected Feb 2, 2017 by Debasmita Bhoumik Kaushik.P.E comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes B is false because all languages which are not recursive enumarable are countable it is not true. Pallav98 answered Aug 1, 2020 Pallav98 comment Share Follow See all 0 reply Please log in or register to add a comment.