Construct a deterministic finite-state
Chapter 12, Problem 12.3.26(choose chapter or problem)
Construct a deterministic finite-state automaton that recognizes the set of all bit strings that do not contain three consecutive Os.
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