Question

Which one of the following is FALSE?

(a) Every NFA can be converted to DFA

(b) Every subset of a recursively enumerable set is recursive

(c) All of the mentioned

(d) None of the mentioned

This question was addressed to me by my college professor while I was bunking the class.

The above asked question is from Minimization of DFA topic in division Finite Automata and Regular Expression of Compiler

Answer 1

Right option is (b) Every subset of a recursively enumerable set is recursive

Easiest explanation: Every subset of a recursively enumerable set is recursive.