Question

Conversion of a DFA to an NFA __________

(a) Is impossible

(b) Requires the subset construction

(c) Is Chancy

(d) Is nondeterministic

I have been asked this question at a job interview.

I would like to ask this question from Non-Deterministic Finite Automata topic in section Finite Automata and Regular Expression of Compiler

Answer 1

The correct option is (b) Requires the subset construction

To explain I would say: In order to convert NDFA to DFA we work with sets of state where each state in the DFA corresponds to a set of NFA states.