The construction time for DFA from an equivalent NFA (m number of node)is:
(a) O(m^2)
(b) O(2^m)
(c) O(m)
(d) O(log m)
I had been asked this question in an online interview.
I want to ask this question from Non Deterministic Finite Automata in portion Finite Automata of Automata Theory