I understand that in a non-deterministic automaton, an input can lead to one, more than one, or no transition for a given state.
Given this information, I would assume that if the input lead to a loop, this loop would be infinite until a determined input happened (being one || more || ε).
However I would like to know if there's a way to represent a "finite" loop with an NFA. For example, an ATM where a person only has a determined amount of chances to get the password right. If not, the operation is cancelled.
The input is always the same (0-9 digits), so how can the outcome be different after 3 tries?
Thank you for any hints on this!