Home About Help Privacy Previous Next
Design a FSM to represent the logic of a vending machine. It sells water for 40p and Irn-Bru for 50p. It accepts 10p and 20p coins.
The user is not required to enter exact money - eg if they enter 60p they should still be able to purchase water.
Accept Reject
'10p, 10p, 10p, 10p, 10p, Irn-Bru' ''
'20p, 20p, Water' '10p, 10p, Water'
'10p, 20p, 20p, Irn-Bru' '10p, 10p, 20p, Water, Water'
'20p, 20p, 20p, Water'
'10p, 10p, 20p, 10p, Water'
Introducing FSMs I Introducing FSMs II Accepting states I Accepting states II Introducing cycles Machine construction I Machine construction II Using longer tokens ▶ Vending machine acceptor Nondeterministic transitions I Nondeterministic transitions II Nondeterministic Transitions III Introducing ε transitions Combining machines with ε transitions Conversion to DFA I Conversion to DFA II Conversion to DFA III Formal machine definition I Formal machine definition II Regular expressions - Kleene star I Regular expressions - Boolean or Regular expressions - Kleene star II Regular expressions - abb(abb)* Introducing minimization Introducing transducers