theory of computation

Unless otherwise noted, the alphabet for all questions below is assumed to be = {0,1}. Also note that all DFAs in your solutions should have one transition for each state in the DFA for each character in the alphabet.

This question tests your comfort with boundary cases of DFAs. Draw the state diagrams of DFAs recognizing each of the following languages.

(a) L = {} for the empty string.

(b) L = .

(c) L = {a, b}