2 votes 2 votes Which f the following statements is FALSE? The intersection of a regular language and a context-free language is context=free The intersection of a regular language and context-free language is regular The union of two context-free languages is context-free The union of two regular languages is regular Theory of Computation isro-2024 theory-of-computation context-free-language regular-language + – Ramayya asked Jan 7 • retagged Jan 7 by Hira Thakur Ramayya 211 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Regular language and CFL are closed under union operation. So C, D is true. Now, the intersection operation of CFL with regular language is closed, that is CFL itself. A is true. Option $(B)$ is false here. Hira Thakur answered Jan 7 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.
