Use Exercise 39 and finite-state automata constructed in
Chapter , Problem 40E(choose chapter or problem)
Problem 40E
Use Exercise 39 and finite-state automata constructed in Example 6 to find deterministic finite-state automata that recognize each of these sets.
a) the set of bit strings that do not begin with two 0s
b)the set of bit strings that do not end with two 0s
c) the set of bit strings that contain at most one 0 (that is, that do not contain at least two 0s)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer