Problems 1/23


Problem 1

Draw a DFA to recognize this language over the alphabet {0,1}.

{w1...wk | wi = 1 for all odd i}

Problem 2

Draw a DFA to recognize this language over the alphabet {0,1}.

{w | 001 is not a substring of w}

Problem 3

Draw a DFA to recognize this language over the alphabet {0,1}.

{w | w begins with 1 or ends with 0}