The automaton which allows transformation to a new state without consuming any input symbols:
(a) NFA
(b) DFA
(c) NFA-l
(d) All of the mentioned
I got this question in an internship interview.
This interesting question is from Uses of Epsilon-Transitions topic in division Finite Automata of Automata Theory