In: Computer Science
Discuss the many real–world systems which are modeled as FSMs (Finite State Machines) (ex. Vending machines, ATMs, Online purchase systems, etc.)
In a Finite State Machine the circuit’s output is defined in a
different set of states i.e. each output is a state. A State
Register to hold the state of the machine and a next state logic to
decode the next state. An output register defines the output of the
machine. In FSM based machines the hardware gets reduced as in this
the whole algorithm can be explained in one process.
Two types of State machines are:
MEALY Machine: In this machine model, the output depends on the present state as well as on the input.
MOORE Machine: In Moore machine model the output only depends on the present state.
Finite state machines are an attractive candidate as a model of
computation. We may view a simple ROM-based FSM as a programmable
general-purpose (or at least multi-purpose) computation machine, in
that its behavior may be modified simply by changing the string of
bits stored in its ROM. Of course, any particular FSM
implementation as a digital circuit necessarily fixes the number of
inputs, outputs, and states as implementation constants, limiting
the range of FSM behaviors that can be achieved by reprogramming
its ROM.
By using finite state machines model so many machines are developed like ATM's, vending machines, Online purchase systems and there are so many robots which are widely used all over the world. These machines fulfills the requirements and its can't be done by humans also. They are very powerful in handling the workload and fullfilling the users requirements.