title: Determinant Finite Automata (JFLAP)
body: <p>I have a DFA question (Determinant Finite Automata) .  We are  using JFLAP to construct the automata.  I cannot figure this question out to save my life!  Here it is</p>
  
  <p>"DFA to recognize the language of all strings that have an even number of zeros and an odd number of ones."</p>
  
  <p>So the alphabet is {0,1}  and only using 0,1.  So I need to build an automata that recognizes an even number of zeros and an odd number of ones.</p>