Q. Which of the following are decidable?1) Whether the intersection of two regular language is infinite.2) Whether a given context free language is regular.3) Whether two push down automata accept the same language.4) Whether a given grammar is context free. (Solved)
1. 1 and 2
2. 1 and 4
3. 2 and 3
4. 2 and 4
- b. 1 and 4