Which of the following are decidable? I. Whether the intersection of two…

PYQ GATE 2008

Which of the following are decidable?

I. Whether the intersection of two regular languages is infinite
II. Whether a given context-free language is regular
III. Whether two push-down automata accept the same language
IV. Whether a given grammar is context-free

  1. A.

    I and II

  2. B.

    I and IV

  3. C.

    II and III

  4. D.

    II and IV

Attempted by 86 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…