Solved: Construct a finite-state automaton that recognizes
Chapter 12, Problem 12.3.35(choose chapter or problem)
Construct a finite-state automaton that recognizes the set of bit strings consisting of a 0 followed by a string with an odd number of I 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