GATE | Sudo GATE 2020 Mock II (10 January 2019) | Question 62

Consider the following statements:

I. Finiteness of CFL is decidable.
II. Membership of recursive language is undecidable.
III. Equivalence problem of CFLs are decidable.

Which of the following statement(s) is/are false ?
(A) Only I
(B) Only II
(C) Both I and III
(D) Both II and III


Answer: (D)

Explanation: Membership of recursive language is decidable and equivalence problem of CFLs are undecidable, You can check decidability table for this.

Option (D) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.