Peter Linz Edition 4 Figure 2.10 Example 2.9 (Page No. 52)

Question

PETER LINZ 

For an nfa, the extended transition function is defined so that ∂*(qi,w) contains qj if and only if there is a walk in the transition graph from qi to qj labeled w. This holds for all qi, qj ∈ Q and w∈S

 

 

 

Comments

If i don't go into the definition of a walk (given in graph theory books), the above sequence mentioned by you is indeed correct.
∂* means 0 or more steps, that's all.
$∂^*(qi,w) ->{qj}$  it means from the state $qi$, on the string $w$, we can reach in state $qj$ in $0$ or more steps.

---

can we repeat states on that walk ..??

---

as i already said, i am not going into the definition of walk, but there can be any number of steps, but eventally the destination sate should be reached.