title: Deterministic Finite Automata with 6 states
body: <p>I am really new to this and to sure how to start. I am trying to do this question for practice</p>
  
  <p>Let  segma = {a,b}. Consider the set of all strings in segma* that have an odd
  number of occurrences of the substring "ab" but do not have "bb" as a substring.
  Give a DFA with six states accepting the set.</p>
  
  <p>I did change my solution.</p>
  
  <p><img src="https://i.stack.imgur.com/uXSKi.png" alt="Attempt"></p>