Finite-State Machine

Finite-State Machine With Outputs

$$M = (S,I,O,f,g,s_0)$$

• S states
• input alphabet I
• output alphabet O
• transition function f that assigns to each state and input pair a new state
• output function g that assigns to each state and input pair an output
• initial state s₀

Finite-State Machine With No Output

Same as above, but a little simpler $$M = (S,I,O,f,s_0)$$

References