# TOC | Construction of finite machines to prints ‘1’ as the output for every occurrence of ‘a’ as a substring

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

In this article, we will see some designing of Finite Automata with Output i.e, Moore and Mealy machines.

**Problem:** Construction of the machines that take set of all string over {a, b} as input and prints ‘1’ as the output for every occurrence of ‘a’ as a substring.

Assume,

Ε = {a, b} and Δ = {0, 1}

where Ε and Δ are the input and output alphabet respectively.

**Explanation:**

The required Moore machine is constructed below:-

In the above diagram, the initial state ‘X’ on getting ‘b’ as the input it remains in the state of itself and print ‘0’ as the output and on getting ‘a’ as the input it transits to a state ‘Y’ and prints ‘1’ as the output. The state ‘Y’ on getting ‘a’ as the input it remains in the state of itself and prints ‘1’ as the output and on getting ‘b’ as the input it goes back to the state ‘X’ and prints ‘0’ as the output.

Thus finally above Moore machine can easily print ‘1’ as the output on getting ‘a’ as the input substring.

Above Moore machine takes set of all string over {a, b} as input and count number of substring ‘a’ i.e, on getting ‘a’ as the substring it gives ‘1’ as the output thus on counting number of ‘1’ we can count the number of substrings ‘a’.

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

**Conversion from Moore machine to Mealy machine:**

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’ and ‘Y’ are kept in the first column which on getting ‘a’ as the input it transits to ‘Y’ and ‘Y’ states respectively, kept in the second column and on getting ‘b’ as the input it transits to ‘X’ and ‘X’ states respectively, kept in the third column.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 ‘a’ as the input it goes to a state ‘Y’ and gives ‘1’ as the output and on getting ‘b’ as the input it goes to the state ‘X’ and gives ‘0’ 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 set of all string over {a, b} as input and count number of substring ‘a’ i.e, on getting ‘a’ as the substring it gives ‘1’ as the output thus on counting number of ‘1’ we can count the number of substrings ‘a’.

**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.

## Recommended Posts:

- Theory of Computation | Finite Automata Introduction
- TOC | Designing Finite Automata from Regular Expression (Set 1)
- Mealy and Moore Machines
- Theory of Computation | Generating regular expression from finite automata
- TOC | Finite Automata with Output (Set 6)
- TOC | Designing Non-Deterministic Finite Automata (Set 3)
- Practice problems on finite automata
- Practice problems on finite automata | Set 2
- DFA machines accepting odd number of 0’s or/and even number of 1’s
- TOC | Designing Deterministic Finite Automata (Set 1)
- TOC | Designing Deterministic Finite Automata (Set 2)
- TOC | Designing Finite Automata from Regular Expression (Set 6)
- TOC | Finite Automata with Output (Set 5)
- TOC | Designing Deterministic Finite Automata (Set 3)
- TOC | Designing Deterministic Finite Automata (Set 4)

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.