Solution: Construct a finite-state machine with output that
Chapter 12, Problem 12.13(choose chapter or problem)
Construct a finite-state machine with output that produces an output of 1 if the bit string read so far as input contains four or more I s. Then construct a deterministic finite-state automaton that recognizes this set.
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