Finite Automata

A finite automaton M has:

• Q is a finite set of states
• is the start state
• is the set of accepting states
• is the finite input alphabet
• is the transition function. Maps a state and an input symbol to another state.