Question

ε- closure of q1 in the given transition graph:

(a) {q1}

(b) {q0, q2}

(c) {q1, q2}

(d) {q0, q1, q2}

I had been asked this question in an interview.

I want to ask this question from Finite Automata with Epsilon Transition topic in chapter Finite Automata of Automata Theory

Answer 1

Right choice is (c) {q1, q2}

Best explanation: ε-closure is defined as the set of states being reached through ε-transitions from a starting state.