**Prerequisite:** Mealy and Moore Machines, Difference between Mealy machine and Moore machine

In this article, we shall see a conversion of Moore to Mealy machine-

**State Transition Diagram of a Moore machine:-**

Above Moore machine takes the binary number {0, 1} as input and produce residue modulo ‘3’ as output i.e, when the equivalent decimal number of binary input over {0, 1} is divided by 3 then it gives output as it’s remainder.

Now we need to transform the above transition diagram of Moore machine to equivalent Mealy machine transition diagram.

Steps for the required conversion are given below:-

**Step-1:**Formation of State Transition Table of the above Moore machine-

In the above transition table, States ‘X’, ‘Y’ and ‘Z’ are kept in the first column which on getting ‘0’ as the input it transits to ‘X’, ‘Z’ and ‘Y’ states respectively, kept in the second column and on getting ‘1’ as the input it transits to ‘Y’, ‘X’ and ‘Z’ states respectively, kept in the third column and In the fourth column under Δ, there are corresponding outputs of the first column states. In the table, An arrow (→) indicates the initial state.**Step-2:**Formation of Transition Table for Mealy machine from above Transition Table of Moore machine-

Below transition table is going to be formed with the help of the above table and its entries just by using the corresponding output of the states of the first column and placing them in the second and third column accordingly.

In the above table, the states in the first column like ‘X’ on getting ‘0’ as the input it goes to a state ‘X’ and gives ‘0’ as the output and on getting ‘1’ as the input it goes to the state ‘Y’ and gives ‘1’ as the output and so on for the remaining states in the first column. In the table, An arrow (→) indicates the initial state.

**Step-3:**Then finally we can form the state trasition diagram of Mealy machine with help of it’s above transition table.

The required diagram is shown below-

Above Mealy machine takes the binary number {0, 1} as input and produce residue modulo ‘3’ as output i.e, when the equivalent decimal number of binary input over {0, 1} is divided by 3 then it gives output as it’s remainder.

**Note:** While converting from Moore to Mealy machine the number of states remains same for both Moore and Mealy machine but in case of Mealy to Moore conversion it does not give the same number of states.

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.

## Recommended Posts:

- Conversion of Moore to Mealy machine (Set 4)
- Conversion of Moore to Mealy machine (Set 9)
- Difference between Mealy machine and Moore machine
- Mealy and Moore Machines in TOC
- Moore and Mealy machines to count number of substring ‘ab’
- Moore and Mealy machines to produce 'A', 'B', 'C' depends on inputs that end with ’10’ or with ’11’ else other
- Design 101 sequence detector (Mealy machine)
- Design a mealy machine for 2's complement
- Mealy Machine for 1's Complement
- Moore Machines implementation in C++
- Conversion from NFA to DFA
- Program to Implement NFA with epsilon move to DFA Conversion
- Conversion of Epsilon-NFA to NFA
- Turing Machine for subtraction | Set 2
- Turing machine for subtraction | Set 1
- Turing Machine in TOC
- Construct Turing machine for L = {a
^{n}b^{m}a^{(n+m)}| n,m≥1} - Construct a Turing Machine for language L = {0
^{n}1^{n}2^{n}| n≥1} - Construct a Turing Machine for language L = {ww
^{r}| w ∈ {0, 1}} - Construct a Turing Machine for language L = {ww | w ∈ {0,1}}

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.