A finite state machine (FSM) is a model of computation that consists of a finite number of states, inputs that trigger transitions between states, and outputs. An FSM can be represented graphically using a state diagram showing the states, transitions, inputs, and outputs. A simple example of an FSM is a ballpoint pen, which has two states (retracted, extended), one input (clicking the button), and one output (retraction or extension of the ballpoint). The state transition diagram and table for a ballpoint pen FSM are provided.

2. What is meant Finite State
Machine?
 A machine that consist of a fixed set of
possible states with a set of allowable
inputs that change the state and a set of
possible outputs
 A Finite state machine consist of
 States
 Inputs
 Output

3. Representation of FSM
 We use state diagram represent an FSM
graphically
 Each state is represented by a circle
 Each transition is represented by an
arrow
 It is used to show all states,inputs and
outputs

4. Example of an FSM
 A ball point is an example of FSM
 It has finite number of states:
Ballpoint extended
Ballpoint retracted
 Set of possible inputs:clicking the pen’s
button
 Set of possible output:retracting of
ballpoint

5. State transition diagram for a ball
point
 State 0 =ballpoint retracted
 State 1 =ballpoint extended
Button clicked
Button clicked
State 0 State 1

6. State Transition Table for Ball point
FSM
Input Current state Next state
Button clicked Ball point retracted Ballpoint extended
Button clicked Ball point extended Ball point retracted

7. THANK YOU