Theory of Computation

Finite Automata

Finite automata are finite collections of states with transition rules that take us
from one state to another.
Representing Finite Automata
A graph, where nodes are states.
State Table

1
 Theory of Computation
Arcs indicate state transitions.
Labels on arcs tell what causes the transition.
Arrow labeled “Start” to the start state.
Final states indicated by double circles.
Example

2
Theory of Computation

3
 Theory of Computation

Example. Find the language accepted by the following machine. Here,

< RESET> is a single symbol.

4
Theory of Computation