πŸ“Š Theory of Computation
Q. Which of the following problem is undecidable?
  • (A) Membership problem for CFL
  • (B) Membership problem for regular sets
  • (C) Membership problem for CSL
  • (D) Membership problem for type 0 languages
πŸ’¬ Discuss
βœ… Correct Answer: (D) Membership problem for type 0 languages

You must be Logged in to update hint/solution

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
535
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
82%
Success Rate