Then put in additional transitions to keep track of consecutive zeros and to
trap unacceptable strings. Also provide for accepting λ and 0.
(d) Here we need to remember all combinations of three bits. This requires
8 states plus some start-up. The solution is a little long but not hard. A
partial sketch of the solution is below.
13. The easiest way to solve this problem is to construct a dfa for L = {a n : n =
4}, and then complement the solution.