Hi, given the state transition table of NFA below. I have a string bababa, I was wondering if this string would be accepted by traversing

from state 1 -> state 3 -> state 1 -> state 4 (epsilon) -> state 3 -> state 4 -> state 3.

z is the substring taking in y is the substring taking M frorn g, back to z is the substring taking M from q, to th, e (Note that z or z m > 0) In that case y simply takes to accept . av lang, . (t C- co 4 aabb ,a 63 142 a1213 1234 el or 6