#02 Problems on DFA
Discussed Deterministic Finite Automata (DFA) with few problems. try the problems below,
1. Draw a DFA to accept the string "aba" over {a,b}
2. Design a DFA for the Language L(M)={0,1} to accept the string 0 followed by one or more 1's
3.For a Regular Language design an Automatan to accept only the even number of a's.