Construct a deterministic finite-state
Chapter 12, Problem 12.3.34(choose chapter or problem)
Construct a deterministic finite-state automaton that recognizes the set of all bit strings that contain an even number of Os and an odd number of 1 s.
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