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