Using Finite State Automata to Model a Vending Machine

1
Using Finite State Automatato Model a Vending
Machine
Model taken from Discrete Mathematics and its
Applications by Kenneth Rosen
2
(No Transcript)
3
Components of a Finite-State Machine
4
Components of a Finite-State Machine
Input Alphabet 5, 10, 25, ButtonOJ, ButtonAJ
5
Components of a Finite-State Machine
Input Alphabet 5, 10, 25, ButtonOJ, ButtonAJ
Output Alphabet 5, 10, 15, 20, 25, OJ, AJ
6
Components of a Finite-State Machine
Input Alphabet 5, 10, 25, ButtonOJ, ButtonAJ
Output Alphabet 5, 10, 15, 20, 25, OJ, AJ
States 0 (Initial State s0), 5 (s1), 10
(s2), 15 (s3), 20 (s4), 25 (s5), 30 (s6)
7
Components of a Finite-State Machine
Transition and Output Functions (of state
input)
8
Interpreting the Model
9
Interpreting the Model
10
Interpreting the Model
11
Interpreting the Model
12
Interpreting the Model
13
Interpreting the Model
14
Interpreting the Model
15
Interpreting the Model

16
Interpreting the Model