Let F be the language of all strings over {0,1} that do
Chapter , Problem 1.13(choose chapter or problem)
Let F be the language of all strings over {0,1} that do not contain a pair of 1s that are separated by an odd number of symbols. Give the state diagram of a DFA with ve states that recognizes F. (You may nd it helpful rst to nd a 4-state NFA for the complement of F.)
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