1.

Conversion of a DFA to an NFA __________(a) Is impossible(b) Requires the subset construction(c) Is Chancy(d) Is nondeterministic

Answer» 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.


Discussion

No Comment Found

Related InterviewSolutions