From the internet: A finite-state machine is formally defined as a 5-tuple (Q, I, Z, ∂, W) such that: Q = finite set of states I = finite set of input symbols Z = finite set of output symbols ∂ = mapping of I x Q into Q called the state transition function, i.e. I x Q → Q W = mapping W of I x Q ...