Topic: Theory of Computation
Which of the following statements is FALSE:
- A. The intersection of a regular language and a context-free language is context-free
- B. The intersection of a regular language and context-free language is regular
- C. The union of two context-free languages is context-free
- D. The union of two regular languages is regular
Answer: B. The intersection of a regular language and context-free language is regular
Explanation: The intersection of a context-free language (CFL) and a regular language is guaranteed to be a CFL, but it is not necessarily regular. For instance, the intersection of $L_{CFL} = \{a^n b^n | n \ge 0\}$ and $L_{Regular} = (a+b)^*$ results in $L_{CFL}$, which is context-free but not regular.