What is the relation between DFA and NFA on the basis of computational power?
(a) DFA > NFA
(b) NFA > DFA
(c) Equal
(d) Can’t be said
This question was addressed to me in exam.
My enquiry is from Extended Transition Function topic in portion Finite Automata of Automata Theory