Q. Which of the following are decidable?I. Whether the intersection of two regular languages is infiniteII. Whether a given context-free language is regularIII. Whether two push-down automata accept the same languageIV. Whether a given grammar is context-free (Solved)
1. I and II
2. I and IV
3. II and III
4. II and IV
- b. I and IV