Automata Theory

1. Give the state diagrams of NFAs with the specified number of states recognizing the following languages over = {0, 1]: a. {w: every odd position of w is a 0 with two states b. {w: w begins and ends with the same symbol with five states c. {w: w does not contain the substring 011} with four states 2. 1.8 3. 1.9 4. 1.10 5. 1.16 6. 1.31 (give a constructive proof of closure)