Suppose L1 = CFL and L2 = Regular, We are to find out whether L1 – L2 = CFL or non CFL.
I have 2 approaches to this question and I am confused which is wrong:
- L1 – L2 = L1 intersection L2’
- L2 being Regular L2’ is also Regular so CFL intersection Regular = CFL
- L2 being Regular L2’ is also Regular and every Regular Language is also CFL so CFL intersection CFL = non CFL.
Can somebody please clarify my doubt?