Deterministic Finite Automata: Examples
0and1Even
This automaton recognizes:
the empty string;
the set of strings with an even number of
1
's and an even number of
0
's;