Scribd
Upload
14 views

Finite State Machine

Uploaded by

jocellmayprado
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

Finite State Machine

Uploaded by

jocellmayprado
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

M A C H I N E

TE STAT E
FINI sented by Group 2
Pre
MEET THE GROUP

Bernabe, John Polistico, Mark


Guilleno, Alvin Encarnacion, Ryan
Robert Jerveys
WHAT IS A FINITE STATE
MACHINE?
A finite state machine (FSM) is a mathematical
model used to represent and control the
behavior of systems that can exist in a finite
number of states at any given time. It is a
concept widely used in computer science,
engineering, and other fields to design, analyze,
and implement systems with discrete and
sequential behavior.
FINITE STATE MACHINE

At its core, an FSM consists of a set of


states, a set of input events or stimuli,
a set of output actions or responses,
and a set of transitions between states
based on input events. It can be
visualized as a directed graph where
nodes represent the states and the
edges connecting the nodes represent
transitions.
TRANSITION DIAGRAM

It is a directed graph
associated with the
vertices of the graph
corresponds to the state
of the finite automata.
ES OF FSM
TYP
FINITE STATE MACHINE
(FINITE AUTOMATA)

WITH OUTPUT
WITHOUT OUTPUT

MEALY MOORE DFA NDFA


DETERMINISTIC
FINITE AUTOMATON (DFA)

In a DFA, each state transition is


uniquely determined by the current
state and input. This means that given
a specific input and current state,
only one possible transition to the
next state exists.
DFA
NON-DETERMINISTIC
FINITE AUTOMATON (NDFA)

Non-deterministic or NDFA allow


multiple transitions for a given input
and current state. This means that the
next state is not uniquely determined
and the machine can be in multiple
states simultaneously.
NDFA
MEALY
Mealy machines are FSMs that not only define the states and transitions but
also associate outputs with each transition. The outputs in these types of
machines rely on both the current state and the input.
EXAMPLE;
MEALY
TRANSITION TABLE
TRANSITION DIAGRAM
MOORE
A Moore machine is a type of FSM where the outputs depend only on the current
state. This implies that regardless of the inputs, the outputs are determined by the
state the machine is in. The transitions between states are triggered by the inputs,
but the outputs are associated with the states themselves.
EXAMPLE;
MOORE
TRANSITION DIAGRAM
TRANSITION TABLE
STIONS?
QUE
THAN
K YOU
REFFERENCES
01 https://www.spiceworks.com/tech/tech-
general/articles/what-is-fsm/

02 https://www.spiceworks.com/tech/tech-
general/articles/what-is-fsm/

03 https://www.javatpoint.com

You might also like