Suppose L1 is a regular language and L2 is a Context-free language. As all regular languages are context-free languages, L1 can be considered as Context-free language. L1 $\cap$ L2 would become <Context-free> $\cap$ <Context-free>. We know that Context free ... lot of places where regular is considered as Context-free and the problems were solved but for this case the result seems to be wrong.

asked
Jul 20, 2019
in Theory of Computation
commenter commenter
11 points
29 views