───✱*.｡:｡✱*.:｡✧*.｡✰*.:｡✧*.｡:｡*.｡✱ ───
A finite state machine is a model of computation which components are a finite set of states, input alphabet, transition function, start state, and one or more final states.
Deterministic and Non-Deterministic
- Deterministic → each state has one subsequent state
- Non-Deterministic → each state does not have one subsequent state
───✱*.｡:｡✱*.:｡✧*.｡✰*.:｡✧*.｡:｡*.｡✱ ───