1 / 10

CSE322 Mealy and Moore Machine

CSE322 Mealy and Moore Machine. Lecture #4. Mealy and Moore Model. In finite Automata acceptability was decided on the basis of reach ability of the final state by initial state. This restriction are removed and new model is given in which output can be chosen from some other alphabet.

agilbert
Download Presentation

CSE322 Mealy and Moore Machine

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSE322Mealy and Moore Machine Lecture #4

  2. Mealy and Moore Model • In finite Automata acceptability was decided on the basis of reach ability of the final state by initial state. • This restriction are removed and new model is given in which output can be chosen from some other alphabet. • The value of the output function Z(t) is a function of present state q(t) and the present input x(t) • Z(t) = λ(q(t), x(t)) Mealy Machine • The value of the output function Z(t) is a function of present state q(t) only and is independent of the current input • Z(t) = λ(q(t)) Moore Machine

  3. Moore Machine Moore Machine is six-tuple (Q,∑,∆,δ,λ,q0): • Q is a finite set of states • ∑ is the input alphabet • ∆ is the output alphabet • δ is the transition function from ∑ X Q into Q • λ is the output function mapping Q into ∆ and • q0 is the initial state

  4. Mealy Machine Mealy Machine is six-tuple (Q,∑,∆,δ,λ,q0): • Q is a finite set of states • ∑ is the input alphabet • ∆ is the output alphabet • δ is the transition function from ∑ X Q into Q • λ is the output function mapping ∑ X Q into ∆ and • q0 is the initial state

  5. Example of Moore Machine

  6. Example of Mealy Machine

  7. Transforming Mealy to Moore Machine

  8. Solution

  9. Transforming Moore to Mealy Machine

  10. Solution

More Related