Computer Science · Theory of Computation
Consider the following problems: (i) Whether a given context-free language is regular. (ii) Membership problem for type-0 languages. Which of the above problems are undecidable?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Neither (i) nor (ii)
- 2Both (i) and (ii)✓
- 3Only (ii)
- 4Only (i)
Correct answer
Both (i) and (ii)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation