Is a door lock a finite state machine? Must the states of a finite state machine be worked off sequentially or could you understand the different shaped parts of the key as input and the position of the pins as states?
If not all the input is right: failure state = stays locked
If all the input is right: end state = lock opens

I was inspired by this (German grammar-school) resource, where on page 7 are diagrams of a combination lock as a finite state machine.
Yes and no. Arguably, the lock is not a finite state machine, since the key can be inserted to any degree and, if it fits, rotated through any angle. However, we can abstract away these unimportant details, yes, the system can be modeled as a finite number of states: essentially, if you code up the ridges of the key as symbols in some alphabet, the lock is a DFA that accepts exactly one word (or perhaps more, if there's a master key).