# CSCI 255, ENGR 274, ECE 212 -- 2 November, 2000

## Announcements

## Finite State Machine example

Implement a vending machine that dispenses Septoes, a candy
that costs $7. This vending machine accepts only two kinds
of bills -- a $2 bill and a $3 bill.
Logically the machine is represented as a sequential circuit
receiving two input streams, one for each type of bill, and
one output stream.

### Representations

- Word problem
- State diagram
- State transistion table
- State assignment
- Flip-flops and excitation table
- Implementation