When can a Non-Deterministic Finite Automaton with Epsilon transitions considered to be in an accepted state?
One issue is that the way you're using the English language is appropriate for talking about DFAs but not appropriate for NFAs.
With a DFA, we can say &quot;the DFA is in state $q$ after reading the input&quot;.  That is well-defined for a DFA.
That is not well-defined for NFAs.  There may be multiple possible runs, each of which ends in a different state.  So it doesn't make sense to say &quot;the NFA is in an accepting state after reading the whole input&quot;, because there may be multiple possible runs, some of which are in an accepting state and some of which are not.
The formal definition of a NFA gives a precise definition of under what conditions a string is considered to be accepted.  Please consult any good textbook.  The short answer to your last question is yes, the input string is accepted in that situation, as there exists a run of the NFA that ends in an accepting state and where the whole input has been consumed.  But there's little point in us repeating material that's already covered in standard textbooks, and if you work through the definitions, you should be able to figure this out for yourself.