I am looking at the following non-deterministic finite automata which accepts all strings that end with at least 2 bs. I am wondering what would happen when you have the input string 'abba' with this automata:
The possible computations I have so far are
q0, q0, q0, q0, q0
q0, q0, q1, q2, ??
q0, q0, q0, q1, ??
Would anyone be able to fill in the '??'s in this automata and be able to explain why they occur?