An NFA may be converted to a DFA using __________
(a) Induction
(b) A construction
(c) Contradiction
(d) Compilation
This question was addressed to me during an online interview.
I want to ask this question from Non-Deterministic Finite Automata topic in chapter Finite Automata and Regular Expression of Compiler