The GATE Grind

GATE 2008 CS – Question 10

Theory of Computation · Turing Machines and Undecidability · 1 mark · Multiple choice

Which are decidable?

I. Whether intersection of two regular languages is infinite.

II. Whether a given context-free language is regular.

III. Whether two PDAs accept the same language.

IV. Whether a given grammar is context-free.

  1. I and II
  2. I and IV
  3. II and III
  4. II and IV

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) I and IV

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Turing Machines and Undecidability questions

All Turing Machines and Undecidability questions →