PROBLEM 1:

Draw the state diagram of a DFA accepting all binary words that are not in the language (10 + 110).

PROBLEM 2:

Consider the method M to M, shown in the lectures, which con- structs the -NFA M accepting (L(M)), for any given -NFA M.

Use that method to construct M when given the NFA M in Fig 1 (no other method will be accepted).

Use that method as a guide to describe a method that constructs a -NFA M+ accepting the language (L(M))+, when given any -NFA M.