In: Computer Science
Construct a finite-state machine, using combinational logic for an apple vending machine that only accepts nickels (5 cents). When 15 cents is deposited the user can push a button to receive an apple and the machine resets. If the user inserts more than 15 cents no money will be returned.
Answer : Given data
* The above mentioned apple vending machine has 3 states:
A: 00 ( 0 cents)
B: 01 ( 5 cents )
C: 10 (10 cents)
* The vending machine is Mealy machine...!!!
* In melay machine inputs and outputs are associated, so this condition is satisfied by the above vending manchine.
* here input is " 5 cents " and output is obainted for 15 cents which is an apple.
* So the state Diagram is as shown below:
* INPUT = N which is either 0 or 1.
* From the above state diagram the state table can be derived as follows:
* STATE equations for next state (L *, M* ) AND OUTPUT O are
________________THE END__________________