LECTURE SERIES TOC

1. Prof.Neeraj Bhargava
Abhishek Kumar
Department of Computer Science
School of Engineering & System
Sciences,
MDS, University Ajmer, Rajasthan, India
1

2. Finite State Machine (FSM)
Moore Machine
Mealy Machine
Moorey to Mealy Conversion
Example
2

3.  A finite state machine is a machine
that has many states and has a
logical way of changing from one
state to the other under guiding
rules.
3

4.  A Mealy Machine is an FSM whose
output depends on the present
state as well as the present input.
In Mealy machine every transition
for a particular input symbol has a
fixed output.
4

5.  In Moore machine. the value of output function
is depend on the present state only. Moore
machine is described by 6-tuples - (Q, Σ, Δ, δ,
λ, q0) where
 1. Q = Finite non-empty set of states;
 2. Σ = Set of input alphabets.
 3. Δ = Set of output alphabets.
 4. δ = Transition function mapping Q X Σ → Q
 5. λ = Output function mapping Q → Δ
 6. q0 = Initial state..
5

6.  Input: Moore Machine
 Output: Mealy Machine
 Step 1: Take a blank Mealy Machine transition
table format.
 Step 2: Copy all the Moore Machine transition
states into this table format..
 Step 3: Check the present states and their
corresponding outputs in the Moore Machine
state table; if for a state Qi output is m, copy it
into the output columns of the Mealy Machine
state table wherever Qi appears in the next
state..
6

7. 7

8. 8

9. 9

10. 10