UTpaper

Free mock tests & test series

Question 194Asked in CIL MT Systems, 27 Feb 2020 (8:00 AM)

Which of following problems are undecidable? I. Membership problem in context-free languages

Which of following problems are undecidable? I. Membership problem in context-free languages II. Whether a given context-free language is regular III. Whether a finite state automation halts on all inputs IV. Membership problem for type 0 languages
  1. AIII and IV
  2. BI and IV
  3. CI and II
  4. DII and IV
Show answerHide answer

Correct answer: (D) II and IV

From CIL MT Systems PYQ, 27 Feb 2020 (8:00 AM)

This is question 194 of CIL MT Systems PYQ, 27 Feb 2020 (8:00 AM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.