Construct a finite-state machine, using combinational logic for an apple vending machine that only accepts nickels...

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.

What are the machine states?
What are the inputs?
What are the outputs?
Draw state table
Draw state diagram
Write the combinational logic for next state and output
Explain if you built a Mealy or Moore machine

Solutions

Expert Solution

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__________________

venereology answered 1 year ago

Next > < Previous

Related Solutions

Code the FSM in C++, and show that the program works. Construct a Finite State Machine...

Code the FSM in C++, and show that the program works. 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 have 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.

How would we make a schematic design for a vending machine that accept nickels, dimes, and...

How would we make a schematic design for a vending machine that accept nickels, dimes, and quarters, and sells drinks at 30 cents each? (disregard changes and there is only 1 type of drink) 2 Hexdecimal values must show the current money input (binary to hexadecimal converter is given), and when the value hits 30 or more, reset the current amount to zero, and LED should be lit to represent a successful. For the flip flop, D-flip flop should be...

Given a snack vending machine, assume the machine accepts bills and coins, after customer input money...

Given a snack vending machine, assume the machine accepts bills and coins, after customer input money and select items, the machine can calculate and dispose snack. a. Finish a class diagram of the snack vending machine using correct UML notations. b. Convert the class diagram above to Java code.

Construct a dfa that accepts strings on {0, 1} if and only if the value of...

Construct a dfa that accepts strings on {0, 1} if and only if the value of the string, interpreted as a binary representation of an integer, is zero modulo five. For example, 0101 and 1111, representing the integers 5 and 15, respectively, are to be accepted.

Discuss the many real–world systems which are modeled as FSMs (Finite State Machines) (ex. Vending machines,...

Discuss the many real–world systems which are modeled as FSMs (Finite State Machines) (ex. Vending machines, ATMs, Online purchase systems, etc.)

Using behavioral VHDL, design a Moore-type finite state machine that detects input test vector that contains...

Using behavioral VHDL, design a Moore-type finite state machine that detects input test vector that contains the sequence of ‘100’. If the sequence ‘100’ is detected, the output Z should go high. The input is to be named W, the output is to be named Z, a Clock input is to be used and an active low reset signal (Resetn) should asynchronously reset the machine. a) Draw the Moore-type model state diagram for the FSM. b) Write the VHDL code...

Using behavioral VHDL, design a Mealy-type finite state machine that detects input test vector that contains...

Using behavioral VHDL, design a Mealy-type finite state machine that detects input test vector that contains the sequence of ‘100’. If the sequence ‘100’ is detected, the output Z should go high. The input is to be named W, the output is to be named Z, a Clock input is to be used and an active low reset signal (Resetn) should asynchronously reset the machine. a) Draw the Mealy-type state diagram for the FSM. b) Write the VHDL code to...

What is a finite-state machine ? What is a pushdown automaton ? What is a Turing...

What is a finite-state machine ? What is a pushdown automaton ? What is a Turing machine? What is a Turing complete language? Compare the finite-state machine , pushdown automaton , and Turing machine.?

Now considering an SR NAND latch as a finite state machine, please draw the corresponding state...

Now considering an SR NAND latch as a finite state machine, please draw the corresponding state transition diagram. You don’t have to show the outputs in the diagram.

Design B: Using behavioral VHDL, design a Mealy-type finite state machine that detects input test vector...

Design B: Using behavioral VHDL, design a Mealy-type finite state machine that detects input test vector that contains the sequence of ‘10’. If the sequence ‘10’ is detected, the output Z should go high. The input is to be named W, the output is to be named Z, a Clock input is to be used and an active low reset signal (Resetn) should asynchronously reset the machine. a) Draw the Mealy-type state diagram for the FSM. b) Write the VHDL...

Subjects