SlideShare a Scribd company logo
3
Most read
6
Most read
7
Most read
Seminar (ECD 1702)
Department of Electronics and Communication Engineering
NIT Mizoram
Topic : Finite State Machine
Presented by:
Priya Devi & Yuvraj Singh
Finite State Machine
• Introduction
• Mealy Machine
• Moore Machine
• Comparison
Introduction:
• FSM's can exist in several states and it goes from one state to another
state based on the present state and the input conditions
• Any synchronous circuit is an FSM of some form
• This means that:
 Combinational logic is an FSM without memory
 Flip-Flops and counters are also FSM's
General FSM
• There are 3 (S0, S1, S2) states so we need a minimum of 2 states variables (A,B) and
2 Flip-Flops.
• The generalized circuit diagram is as show below:
General F SM
• The circuit diagram consists of:
➤Combinational block: with primary input w and primary output z. it
also consist of secondary inputs (present state) and secondary outputs
(next state)
➤ Memory block: consist mainly of Flip-Flops.
Example
There are numerous examples of everyday devices that are controlled by
a state machine:
• Traffic light
• Garage Door Numeric Keypad
• Vending Machine
Outputs of state machines:
• No provision has been made to show the output z which is different
from the state variables. The output can therefore be modelled in two
distinct ways
➤ Moore machines
➤ Mealy machines
➤D = F(W,Q)
➤Z = G(Q)
➤F and G are Boolean functions
➤Output only depends on the current state (Q)
➤Input (W) and current state (Q) determine the next state (D)
➤ D = F ( W,Q )
➤ Z = G( W,Q )
➤ Fand G are Boolean functions
➤ Output depends on both current state (Q) and input (W)
➤ Next state (D) depends on input (W) and current state (Q)
Comparison: Moore vs Mealy
• Output Timing
• Complexity of State Design
• Response Time to Input Changes
• Applications
• Design Complexity
Choosing between Moore and Mealy machines
• It actually comes down to the task at hand when choosing between Mealy and More
machines
• These are a few questions to ask when choosing between either of the two:
 Does one want to have a synchronous or asynchronous machine?
 Is speed paramount?
 Are both the inputs and present state readily available?
• The answer to each of these questions determines the type of machine that
would work best.
Thank you

More Related Content

PPTX
Finite state machines
PPSX
Finite state automaton
PPTX
MOC2.PPT[1].pptx introduction to mealy machine and moore machine with eample ...
PPT
Moore and Mealy machines
PPTX
Applications of Mealy & Moore Machine
PPTX
10 Mealy and Moore model in discrete maths
PPTX
Synchronous state machines. Moore and Mealy state machines (FSM)
PPT
Introduction state machine
Finite state machines
Finite state automaton
MOC2.PPT[1].pptx introduction to mealy machine and moore machine with eample ...
Moore and Mealy machines
Applications of Mealy & Moore Machine
10 Mealy and Moore model in discrete maths
Synchronous state machines. Moore and Mealy state machines (FSM)
Introduction state machine

Similar to Finite state machine and it's types and working (20)

PPT
19-MooreMealy.ppt
PPTX
Moore and mealy machine
PPTX
Finite State Machines Digital Logic Design .pptx
PPTX
Finite State Machine.ppt.pptx
PPTX
melay and moore machine.pptx
PPT
Logic and computer design.ppt
PPT
Introduction to Embedded SystemIntroduction to Embedded System03
PPTX
Unit I_CDA-1 computer design and applications.
PPTX
PDF
Synchronous sequential Circuits
PPT
Embedded system design process_models
PPTX
Modeling FSMs
PPTX
mealy moore machine conversion
PPTX
synchronous state machine design
PDF
state_machines1.pdf
PPTX
States, state graphs and transition testing
PPT
advanced fpga based system design VI.ppt
PPTX
MODULE 2 OF EMBEDDED SYSTEM KTU SYLLABUS
PPT
9920Lec12 FSM.ppt
19-MooreMealy.ppt
Moore and mealy machine
Finite State Machines Digital Logic Design .pptx
Finite State Machine.ppt.pptx
melay and moore machine.pptx
Logic and computer design.ppt
Introduction to Embedded SystemIntroduction to Embedded System03
Unit I_CDA-1 computer design and applications.
Synchronous sequential Circuits
Embedded system design process_models
Modeling FSMs
mealy moore machine conversion
synchronous state machine design
state_machines1.pdf
States, state graphs and transition testing
advanced fpga based system design VI.ppt
MODULE 2 OF EMBEDDED SYSTEM KTU SYLLABUS
9920Lec12 FSM.ppt
Ad

Recently uploaded (20)

PPTX
UNIT-1 - COAL BASED THERMAL POWER PLANTS
PPTX
bas. eng. economics group 4 presentation 1.pptx
PPTX
MCN 401 KTU-2019-PPE KITS-MODULE 2.pptx
PPTX
Infosys Presentation by1.Riyan Bagwan 2.Samadhan Naiknavare 3.Gaurav Shinde 4...
PPTX
CH1 Production IntroductoryConcepts.pptx
PPTX
MET 305 2019 SCHEME MODULE 2 COMPLETE.pptx
PPTX
CARTOGRAPHY AND GEOINFORMATION VISUALIZATION chapter1 NPTE (2).pptx
DOCX
573137875-Attendance-Management-System-original
DOCX
ASol_English-Language-Literature-Set-1-27-02-2023-converted.docx
PPTX
web development for engineering and engineering
PPTX
Construction Project Organization Group 2.pptx
PPTX
Sustainable Sites - Green Building Construction
PPTX
KTU 2019 -S7-MCN 401 MODULE 2-VINAY.pptx
PPTX
CYBER-CRIMES AND SECURITY A guide to understanding
PPTX
Geodesy 1.pptx...............................................
PPT
Mechanical Engineering MATERIALS Selection
PPTX
IOT PPTs Week 10 Lecture Material.pptx of NPTEL Smart Cities contd
PDF
Operating System & Kernel Study Guide-1 - converted.pdf
PDF
BMEC211 - INTRODUCTION TO MECHATRONICS-1.pdf
PPTX
UNIT 4 Total Quality Management .pptx
UNIT-1 - COAL BASED THERMAL POWER PLANTS
bas. eng. economics group 4 presentation 1.pptx
MCN 401 KTU-2019-PPE KITS-MODULE 2.pptx
Infosys Presentation by1.Riyan Bagwan 2.Samadhan Naiknavare 3.Gaurav Shinde 4...
CH1 Production IntroductoryConcepts.pptx
MET 305 2019 SCHEME MODULE 2 COMPLETE.pptx
CARTOGRAPHY AND GEOINFORMATION VISUALIZATION chapter1 NPTE (2).pptx
573137875-Attendance-Management-System-original
ASol_English-Language-Literature-Set-1-27-02-2023-converted.docx
web development for engineering and engineering
Construction Project Organization Group 2.pptx
Sustainable Sites - Green Building Construction
KTU 2019 -S7-MCN 401 MODULE 2-VINAY.pptx
CYBER-CRIMES AND SECURITY A guide to understanding
Geodesy 1.pptx...............................................
Mechanical Engineering MATERIALS Selection
IOT PPTs Week 10 Lecture Material.pptx of NPTEL Smart Cities contd
Operating System & Kernel Study Guide-1 - converted.pdf
BMEC211 - INTRODUCTION TO MECHATRONICS-1.pdf
UNIT 4 Total Quality Management .pptx
Ad

Finite state machine and it's types and working

  • 1. Seminar (ECD 1702) Department of Electronics and Communication Engineering NIT Mizoram Topic : Finite State Machine Presented by: Priya Devi & Yuvraj Singh
  • 2. Finite State Machine • Introduction • Mealy Machine • Moore Machine • Comparison
  • 3. Introduction: • FSM's can exist in several states and it goes from one state to another state based on the present state and the input conditions • Any synchronous circuit is an FSM of some form • This means that:  Combinational logic is an FSM without memory  Flip-Flops and counters are also FSM's
  • 4. General FSM • There are 3 (S0, S1, S2) states so we need a minimum of 2 states variables (A,B) and 2 Flip-Flops. • The generalized circuit diagram is as show below:
  • 5. General F SM • The circuit diagram consists of: ➤Combinational block: with primary input w and primary output z. it also consist of secondary inputs (present state) and secondary outputs (next state) ➤ Memory block: consist mainly of Flip-Flops.
  • 6. Example There are numerous examples of everyday devices that are controlled by a state machine: • Traffic light • Garage Door Numeric Keypad • Vending Machine
  • 7. Outputs of state machines: • No provision has been made to show the output z which is different from the state variables. The output can therefore be modelled in two distinct ways ➤ Moore machines ➤ Mealy machines
  • 8. ➤D = F(W,Q) ➤Z = G(Q) ➤F and G are Boolean functions ➤Output only depends on the current state (Q) ➤Input (W) and current state (Q) determine the next state (D)
  • 9. ➤ D = F ( W,Q ) ➤ Z = G( W,Q ) ➤ Fand G are Boolean functions ➤ Output depends on both current state (Q) and input (W) ➤ Next state (D) depends on input (W) and current state (Q)
  • 10. Comparison: Moore vs Mealy • Output Timing • Complexity of State Design • Response Time to Input Changes • Applications • Design Complexity
  • 11. Choosing between Moore and Mealy machines • It actually comes down to the task at hand when choosing between Mealy and More machines • These are a few questions to ask when choosing between either of the two:  Does one want to have a synchronous or asynchronous machine?  Is speed paramount?  Are both the inputs and present state readily available? • The answer to each of these questions determines the type of machine that would work best.