Finite State Machines A finite state machine offers a mathematical model to describe the behaviour of a computer system. They are a powerful tool to represent the solutions to problems, ranging from the study of language and artificial intelligence to the design of logical circuits and general software engineering.
Every finite state machine is defined by • a number of finite states - the machine can only be in one state at a time: S1
S2
• an alphabet - the machine can only accept inputs from this set of symbols inputs = {a, b} • state transition function(s) or triggering events - when applied to the machine, this function takes the current state and returns the new state, based on a given input
a b S1
S2
a
Current State
Input
Next State
S1
a
S2
b
S1
a
S2
b
S1
S2
b !
Example A turnstile, where S1 = locked, S2 = unlocked and a = coin and b = push
by Melanie Dennig
PDF Introduction to Finite State Machines.pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. PDF Introduction ...
