AUTOMATA MACHINES

1. Give the state diagrams of DFAs recognizing the following languages over = {0, 1}:

1. {w : w has prefix 101}
2. {w : w has suffix 011}
3. {w : w contains the substring 100}

2. Give the state diagrams of DFAs recognizing the following languages over = {0, 1}:

1. {w : w does not contain substring 10}
2. {w : every odd position of w is a 1}
3. {w : w does not begin and end with same symbol}