A non-deterministic finite state machine accepts a sequence if there is at least one path for that sequence that ends in an accepting state.
For the sequences below, tick those that the machine would accept.
For the sequences below, tick those that the machine would accept.
| aaab | |||
| ac | |||
| baabc | |||
| abb | |||
| abba | |||
| aaaabcb |