## Discussion Forum

Que. | Which of the following problems is decidable for recursive languages (L)? |

a. | Is L = ϕ? |

b. | Is w ∈ L, where w is a string? |

c. | Is L = Σ*? |

d. | Is L = R, where R is a given regular set? |

Answer:Is w ∈ L, where w is a string? |