Finite Automata

A finite automata M = (Q, q₀, A, $\Sigma$, $\delta$), where

• Q = set of states (s_i)
• q₀ = start state (s₀)
• A = set of accepting states
• $\Sigma$ = input alphabet
• $\delta$ = transition function Qx$\Sigma$ $\rightarrow$ Q