Draw the state diagram of a DFA that accepts L = {w ∈ {0,1}* | w has even number of 0's and ends with 1}.
Draw the state diagram of a finite automaton that accepts the language of all strings over {a, b} that contain the substring bab or the substring aba. Your finite automaton should not be overly complicated.