- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Convert the given Moore machine counts into equivalent Mealy machine.
Moore machine described by 6 tuples
(Q, q0, Σ, O, δ, λ)
Where,
- Q: Finite set of states
- q0: Initial state of machine
- Σ: Finite set of input symbols
- O: Output alphabet
- δ: Transition function where Q × Σ → Q
- λ: Output function where Q → O
Given Σ ={a,b} and Δ ={0,1}
Sequence= ‘abb’
Partial Moore machine with sequence ‘abb’ is as follows −
The Full Moore Machine is as follows
The transition tables for Moore and Mealy Machines are as follows −
Transition table for Moor Machine −
State | a | b | o/p |
---|---|---|---|
A | B | A | 0 |
B | B | C | 0 |
C | B | D | 0 |
D | B | A | 1 |
Transition table for Mealy Machine −
State | a | b | ||
---|---|---|---|---|
State | O/p | State | O/p | |
A | B | 0 | A | D |
B | B | 0 | C | 0 |
C | B | 0 | D | 1 |
D | B | 0 | A | 0 |
The Mealy Machine transition diagram is as follows −
Advertisements