4 4 votes Consider the following types of languages: $\text{L1}:$ Regular, $\text{L2}:$ Context-free, $\text{L3}:$ Recursive, $\text{L4}:$ Recursively enumerable. Which of the following is/are $\text{TRUE}$ ? $\text{L3}’ \cup \text{L4}$ is recursively enumerable $\text{L2} \cup \text{L3}$ is recursive $\text{L1}^{\ast} \cup \text{L2}$ is context-free $\text{L1} \cup \text{L2}’$ is context-free $\text{I}$ only $\text{I}$ and $\text{III}$ only $\text{I}$ and $\text{IV}$ only $\text{I, II}$ and $\text{III}$ only Theory of Computation nielit2022apr-scientistb theory-of-computation recursive-and-recursively-enumerable-languages + – soujanyareddy13 4.2k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 3 3 votes Answer: D Recursive languages are closed under complementation hence $L_3’$ is recursive, and recursively enumerable too, and REL is also closed under union. So, $L_3’ \cup L_4 $ is recursively enumerable. $L_2$ is CFL hence recursive too and recursive is closed under union. Therefore, $L_2 \cup L_3$ is recursive. $L_1$ is regular language and it is closed under kleen star operation, hence $L_1^*$ is regular hence CFL too, and CFL is closed under union operation. So, $L_1^*$ $\cup$ $L_2$ is CFL. CFL are not closed under complementation. Therefore $L_2’$ may or may not be CFL but every CFL is also CSL and CSL is closed under complementation. So, $L_1 \cup L_2’$ is CSL (may or may not be CFL). Refer: https://gatecse.in/closure-property-of-language-families/ Shoto answered Apr 14, 2022 • selected Apr 14, 2022 by Arjun Shoto comment Share Follow See all 3 Comments 3 3 Comments reply Arjun commented Apr 14, 2022 reply Follow flag Reasoning for IV is not correct. What if $L_2 = \{\},$ which is a CFL? 1 1 replyShare Shoto commented Apr 14, 2022 reply Follow flag Yes sir, you are right. CFL is not closed under complementation hence it may or may not be CFL but CFL is also CSL and CSL is closed under complementation so $L1 \cup L2’$ is CSL. Is this correct @Arjun sir? 1 1 replyShare Kabir5454 commented Apr 14, 2022 reply Follow flag Counter example , L1={${\varepsilon }$}…...………….....…..(Regular) L2=complement of the language {${ww | w \in (a+b)^{+} }$}…..………..….(CFL) $\bar{L2}=\left \{ ww| w\in (a+b)^{+} \right \}$…....……….….(CSL) $L1 \bigcup \bar{L2}=\left \{{\epsilon } \right \}\bigcup \left \{ ww |w\in (a+b)^{+}\right \}$.………...(CSL) 1 1 replyShare Please log in or register to add a comment.