Finite Automata

A finite automaton M has:

• Q is a finite set of states
• $q_0 \in Q$ is the start state
• $A \subseteq Q$ is the set of accepting states
• $\Sigma$ is the finite input alphabet
• $\delta$ is the transition function. Maps a state and an input symbol to another state.