Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?
(a) yes
(b) no
I have been asked this question in an interview.
My enquiry is from Uses of Epsilon-Transitions in division Finite Automata of Automata Theory