Back to Questions

Computer Science Fundamentals Algorithms Objective

Mar 01, 2013

Which of the following problem is undecidable?

Choose the correct answer:

A) membership problem for CFL

B) membership problem for regular sets

C) membership problem for CSL

D) membership problem for type 0 languages

Detailed Explanation

Option d is right answer.

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts

Feedback