Exercises 3 1) Let = {D, L}. Find a DFA that accepts Password (P) with the following conditions: P> 4 P begins with a letter and ends with a letter. P contains at least one digit. 2) Let = { 0..9, :). Find a DFA that accepts time from 00:00 to 23:59 3) In many companies, the access to certain departments is only for certain employees allowed. A number code is entered at the entrance or a magnetic card on which the employee number is stored, is inserted. Consider the following DFA that has access to the laboratories of company controlled. The employee number becomes read as a binary number. Which employee numbers are accepted. 1 0 0 0 0 1 0 1 4) For = {a , b}. Construct DFA's that accept the set consisting of a- all strings with exactly one a. b- all strings with at least one a. c - all strings with no more than three a's. d- all strings with at least one a and exactly two b's. e-all strings with exactly two a's and more than two b's. 5) Let = {0,1}. Construct a dfa for the following languages: a- Every 00 is followed is followed immediately by 1. For example the strings 101, 0010, 0010011001 are in the language, but 0001, 00100 are not. b- The left most symbol differs from the right most one 6) Find DFA's on {a} for: a- L ={a": n4 ) b- L = {a": n74 7) Let S = (a, b). Find DFA's for: a) L = {wa: w {a,b} } b) L = { awa: we {a,b}" } c) L = { wa : w {a,b} } d) L = {wab: w (a,b)"} e) L = { abwab: w {a,b)"} f) L = {ab wb : w {a,b}" }