3 3 votes For a language $L$ over the alphabet $\{a, b\}$, let $\overline{L}$ denote the complement of $L$ and let $L^{\ast}$ denote the Kleene-closure of $L$. Consider the following sentences. $\overline{L}$ and $L^{\ast}$ are both context-free. $\overline{L}$ is not context-free but $L^{\ast}$ is context-free. $\overline{L}$ is context-free but $L^{\ast}$ is regular. Which of the above sentence(s) is/are true if $L=\left \{ a^{n}b^{n} \mid n\geq 0\right \}$? Both (i) and (iii) Only (i) Only (iii) Only (ii) None of the above Theory of Computation tifr2021 theory-of-computation context-free-language + – soujanyareddy13 1.1k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
2 2 votes Option $(B)$ $\bar{L} = \{a^nb^m|n \neq m ;n,m \geq 0\}$ This is CFL $L^{*} = (a^nb^n)^*$ will always be CFL as CFL are closed under kleene-closure but it is not regular as it requires $b$ to match with the $a$ before starting with another runs of $a$. jatinmittal199510 answered Mar 25, 2021 • edited Mar 27, 2021 by jatinmittal199510 jatinmittal199510 comment Share Follow See 1 comment 1 1 comment reply Hazard commented Apr 8, 2025 reply Follow flag Good question. 0 0 replyShare Please log in or register to add a comment.