DFA short exercise

Construct a DFA for each of the following languages. In each case, let the alphabet be {a, b}.

These exercises are taken from Lewis and Papadimitriou, Elements of the Theory of Computation, Prentice Hall, 1998. There's a copy in the CSCI 335 library.


Last modified: Tue Mar 24 17:01:44 CDT 2009