Finite State Machine
S ={ s0, s1, . . . sn-1} is a finite set of states.
I = { i0, i1, . . . ik-, 1} is a finite set of input values.
O= { o0, o1, . . . om-1} is a finite set output values.
Definition: A finite state machine is a function F:(S x I )-> (S x O) that gets a sequence of input values Ik? I, k = 0,1,2 , • • • and it produces a sequence of output values Ok?O, k= 1,2, • • • such that: F(sk, ik) = (sk+1, ok+1 ) K=0, 1, 2, • • •