A finite state machine is non-deterministic if it has more than one possible transition out of a state for a particular input symbol.
When there is more than one possible path, all possible paths are considered simultaneously.

The machine below could be in 3 possible states after receiving the input "y, y". Select them.