Automata Theory

1. Let D= {w: w contains an even number of O's and contains an odd number of l's and does not contain substring 01} over = {0,1}. a) Give the state diagram of a DFA with five states that recognizes D. b) Give a regular expression that generates D