THEORY OF AUTOMATA– Lecture

20
Equivalent machines
Lecture Outline
• Applications of complementing and
incrementing machines,
• Equivalent machines,
• Moore equivalent to Mealy, proof, example,
• Mealy equivalent to Moore, proof, example
Summary
• Moore equivalent to Mealy, proof, example,
• Mealy equivalent to Moore, proof, example
Reference
• Theory of computation by Daniel. I
.Cohen
• Lecture slides compilation resource [Theory Of
Automata by Dr. M M Alam]