An NFA is nothing more than an ε-NFA with no ε transitions.
(a) True
(b) False
This question was addressed to me by my school teacher while I was bunking the class.
My query is from The NFA with epsilon-moves to the DFA-2 topic in chapter Finite Automata and Regular Expression of Compiler