Description

Design a DFSA for a vending machine with cookies

for $10$cents and for $25$cents. The machine accepts

only nickels$(5)$ and dimes $(10)$ only. The machine

will dispense the $10$cents cookie only if there is

enough money inserted and the Cookie button is

pressed $($no change is given$).$ The machine will

dispense the $25$ cent cookie as soon as enough

money is inserted $($no change is given$).$

The input alphabet is what the user can tell

the machine, which is is N or D $($nickel or

dime$)$ and the Cookie button

The needed tokens $($what the action must be$)$

are GiveCookie$10,$ GiveCookie$25$

Design a DFSA to recognize three tokens: an

identifier $($start with a letter and continue with any

number of letters and digits$),$ the while keyword,

the why keyword $($assume both keyword are

recognized as such individually directly in the FSA$)$

For both design as a graph $($labeled$,$ directed, with one

node identified as the starting node, and each final state

identified as recognizing a named token$)$