title: { w | at every odd position of w is a 1}
body: <p>The task is to construct a DFA for this language over the alphabet {0,1}. </p>
  
  <p>I have constructed a DFA that consists of 4 states and that does not accept an empty word. However, in the answers they give a 3 state DFA that accepts it. </p>
  
  <p>Why should my DFA accept an empty word if in the empty word there is no 1 at the odd position which means that it is not in the language?</p>