UTpaper

Free mock tests & test series

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

Which of the following statement is false?

  1. AEvery regular language is also a context free language
  2. BEvery non deterministic Turing machine can be converted to an equivalent deterministic Turing machine
  3. CEvery subset of recursively enumerable set is recursive.
  4. DEvery NFA can be converted into equivalent DFA
Show answerHide answer

Correct answer: (C) Every subset of recursively enumerable set is recursive.

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

This is question 167 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.