Construct the state table and state digraph of a finite-state machine that models a
Chapter 15, Problem 1(choose chapter or problem)
Construct the state table and state digraph of a finite-state machine that models a vending machine in which two cherry cough drops or two lemon cough drops can be purchased for 15. The vending machine accepts nickels and dimes only. If more than 15 has been deposited, any amount over 15 is immediately returned. Once 15 has been deposited, one of two buttons (C for cherry and L for lemon) can be pushed to purchase cherry cough drops or lemon cough drops.
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