In 8 and 9 a finite-state automaton is given by an
Chapter 12, Problem 9E(choose chapter or problem)
Problem 9E
In 8 and 9 a finite-state automaton is given by an annotated nextstate table. For each automaton:
a. Find its states.
b. Find its input symbols.
c. Find its initial state.
d. Find its accepting states.
e. Draw its transition diagram.
Next-State Table
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