Suppose M is a CFL and N is aa RL. Then wouldn't the language generated by the intersection of M and N contain strings, some of which are accepted by both DFA and PDA? So if they are accepted by a DFA as well, then why is the generated language not an RL?
Why is the intersection of CFL and RL not always RL?
formal languages;context free;closure properties