in Theory of Computation retagged by
172 views
2 votes
2 votes

Which f the following statements is FALSE?

  1. The intersection of a regular language and a context-free language is context=free
  2. The intersection of a regular language and context-free language is regular
  3. The union of two context-free languages is context-free
  4. The union of two regular languages is regular
in Theory of Computation retagged by
by
172 views

1 Answer

1 vote
1 vote
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.

Related questions