Suppose that a finite-state automaton has two states s0 and s1, two input values 0 and 1
Chapter 15, Problem 11(choose chapter or problem)
Suppose that a finite-state automaton has two states s0 and s1, two input values 0 and 1 and a transition function f defined by f(s0, 0) = s0, f(s0, 1) = s1, f(s1, 0) = s1, f(s1, 1) = s0. Construct the state table and state digraph of a finite-state automaton.
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