Question

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

Answer 1

The correct option is (a) yes

Best explanation: Yes, the language is preserved during the dteps of construction: L(N)=L(N1)=L(N2)=L(3).