I am new to Automata Theory. I am studying the book thoroughly and understanding it well. I have got a confusion regarding NFA. Why does this automaton accept the empty string ?What I think is that: implicitly (q,)=q for all states q. But here also explicitly defined (q0,)=q2. As there is a walk to the final state using (q0,)=q0, so (q0,)=q2 will not be followed. Am I correct?  
Why does this automation accept the empty string?
automata;finite automata
An automaton accepts $\lambda$, the empty string, if and only if the starting state is a final state, or there is some final state in the empty-string-closure of the starting state (in the non-deterministic case).You don't need to walk from the start state, since it is already final. The fact that you have the option to doesn't mean you are obligated to.