Theory of Computation: NFA with example

[@TheTamorres]

if in DFA, only one arrow can be draw from each state to the next (meaning only next state from each state), how did you have q0 --> q1 AND q0 -->q1 q1--> q2 AND q1 --> q0 q2 --> q2 AND q2 --> q0 doesn't this break the rule that only one input from each transition state is allowed?

[@hemalsri2746]

its only one transition allowed for one input symbol so its not wrong ig

[@sharada5372]

is it not possible for the nfa to accept strings like 1001? as: S(q0, 1) = q0 S(q0, 0) = q1 S(q0, 0) = q2 this would lead to an incorrect string being accepted