Question: Construct a finite-state machine that models an old fashioned soda machine that accepts nickels, dimes, and quarters. The soda machine accepts change until 35 cents

Construct a finite-state machine that models an old fashioned soda machine that accepts nickels, dimes, and quarters. The soda machine accepts change until 35 cents has been put in. It gives change back for any amount greater than 35 cents. Then the customer can push buttons to receive either a cola, a root beer, or a ginger ale.

Step by Step Solution

3.53 Rating (170 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

We model this machine as follows There are four possible inputs which we denote by 5 10 25 and b sta... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

923-M-C-M-S (2671).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!