CS Theory Automata Computer Science

4. Each of the following languages are composed of two simpler languages over the alphabet 2 = {a, b, c}. For both, construct the DFA's for the simpler languages, then combine them using the construction of the closure proof presented in lecture (and page 46 of text): a. {w: w starts with b and has at most one a} b. {w: w has an even number of a's or ends in c}