What is the relation between NFA-accepted languages and DFA accepted languages?
(a) >
(b) <
(c) =
(d) <=
I have been asked this question in a national level competition.
The question is from Transformation from NFA to DFA in section Finite Automata and Regular Expression of Compiler