All Questions
2 questions
0
votes
1
answer
386
views
is determining an unknown CFL from intersection of two CFLs decidable?
this problem was asked over a week ago on cs.se now with 7v and no answers so far, ie still "open". (there are many somewhat related problems/near variants re CFLs but its not obvious how to reduce it ...
- 11.1k
-2
votes
1
answer
724
views
Intersection between context-free and context-sensitive language decidability [closed]
I'm trying to find a formal proof of the following fact:
Given a context-free language, say $L_1$, and a context-sensitive language, say $L_2$, it is NOT decidable if their intersection is empty ($...
- 1