title: Finding the complement of a DFA?
body: <p>I am asked to show DFA diagram and RegEx for the complement of the RegEx <code>(00 + 1)*</code>. In the previous problem I had to prove that the complement of a DFA is closed and is a regular expression also, so I know that to convert a DFA, M to the complement, M`, I just need to swap the initial accepting states and final accepting states.</p>
  
  <p>However, it appears that the initial accepting states for the RegEx are <code>{00, 1, ^}</code> and the final accepting states are <code>{00, 1, ^}</code> as well. So swapping them will just result in the exact same RegEx and DFA which seems contradictory. </p>
  
  <p>Am I doing something wrong or is this RegEx supposed to not have a real complement?</p>
  
  <p>Thank you</p>