1 / 9

Mealy vs Moore

Mealy vs Moore. 2 examples of problems where Moore FSM has more than 1 extra state versus Mealy FSM. Problem. Σ o = {t, f} Σ I ={0, 1} Outputs t  at least 2 last input digits are same. Solutions.

eze
Download Presentation

Mealy vs Moore

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. Mealy vs Moore 2 examples of problems where Moore FSM has more than 1 extra state versus Mealy FSM

  2. Problem • Σo = {t, f} ΣI ={0, 1} • Outputs t  at least 2 last input digits are same

  3. Solutions One can see that Mealy implementation needs only 3 states, while Moore implementation needs 2 more almost duplicated states just in order to the output value t there (filled in green).

  4. Mealy 0/t 0/f 1/t 0 1 S 0/f 1/f 1/f

  5. Moore 1 11/t 0 0 1 0/f 1/f S/f 0 1 0 0 1 00/t 1

  6. One More Problem • Σo = {t, f} ΣI ={a, b, c} • Outputs t  the last 3 input symbols were either ‘abc’ or ‘cba’

  7. Solutions One can see that Mealy implementation needs only 5 states, while Moore implementation needs 2 more almost duplicated states just in order to the output value t there (filled in green).

  8. Mealy a/f a/f A b/f B’ b/f a/f b/f c/t a/f O a/t c/f c/f b/f C B” b/f c/f c/f

  9. Moore a b a a A /f b B’/f A /t t b a c a b a O/f C /t t c c c a c b C/f B”/f b c c b

More Related