際際滷

際際滷Share a Scribd company logo

Moorey to mealy conversion

Download as PPTX, PDF
D
Dr. ABHISHEK K PANDEY

This document discusses finite state machines, specifically Moore and Mealy machines. It defines Moore machines as having output that depends only on the present state, while Mealy machines have output that depends on both the present state and input. The document then provides a 3-step process for converting a Moore machine to a Mealy machine by copying the Moore machine's state transitions and outputs to a Mealy machine transition table.

1 of 10
Download to read offline
Prof.Neeraj Bhargava Abhishek Kumar Department of Computer Science School of Engineering & System Sciences, MDS, University Ajmer, Rajasthan, India 1
Finite State Machine (FSM) Moore Machine Mealy Machine Moorey to Mealy Conversion Example 2
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
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
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
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
8
9
10

More Related Content

Moorey to mealy conversion

  • 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