Choose the correct statement regarding decidability:

• I – A string belongs to a regular language, CFL, CSL, Recursive language, and Recursively enumerable languages are decidable.
• II – Finiteness of CSL decidable.
• III – Emptiness of CFL and CSL are not decidable.
• IV – Emptiness of regular language and CFL are decidable.

(A) I, II and III
(B) II, III and IV
(C) Only I
(D) Only IV


Answer: (D)

Explanation:

1. Membership of regular language, CFL, CSL, and Recursive language is decidable but for RE it are not decidable.
2. Finiteness of CSL is not decidable.
3. The emptiness of CFL is decidable but for CSl it is undecidable.
4. The emptiness of regular language and CFL are decidable.

So, option (D) is correct.

Quiz of this Question