1 / 7

Finite-State Machines

Finite-State Machines. Transition assigned machine (Mealy). State assigned machine (Moore). (a) State Diagram. (b) State Table. Construction of M s from M t. M t :. M s :. Example of the partitioning procedure. Construction of a reduced machine. (a). (b).

jackson-gonzalez
Télécharger la présentation

Finite-State Machines

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. Finite-State Machines

  2. Transition assigned machine (Mealy)

  3. State assigned machine (Moore) (a) State Diagram (b) State Table

  4. Construction of Ms from Mt Mt : Ms :

  5. Example of the partitioning procedure

  6. Construction of a reduced machine (a) (b)

  7. Testing two machines for equivalence (a) M1 (b) M2 (c) Sum of M1 and M2 P1 : {A, D}, {B, E, G}, {C, F, H} P2 : {A, D}, {B, E}, {G}, {C, F}, {H} P3 =P2

More Related