Deterministic Finite Automaton

Structure $M=(Q,\mathrm{\Sigma },\delta ,s,F)$ where

• $Q:$ set of states
• $\mathrm{\Sigma }:$ Alphabet
• $\delta :Q\times \mathrm{\Sigma }\to Q:$ transition function
  • What will be the next state if we are in $q\in Q$ and consume some $a\in \mathrm{\Sigma }$

Slide Notation

• Double circle is the "final" state that we want, accept if we end at that point

Book Notation

• circle around final state

Regular Set

See also:
Nondeterministic Finite Automata