Which of the steps are non useful while eliminating the e-transitions for the given diagram?
(a) Make a as accepting state of N’ if ECLOSE(p) contains an accepting state of N
(b) Add an arc a to f1 labelled a if there is an arc labelled a in N from some state in ECLOSE(a) to f1
(c) Delete all arcs labelled as e
(d) None of the mentioned
I had been asked this question during an internship interview.
The question is from Epsilon Closures topic in division Finite Automata of Automata Theory