Scribd Logo
Upload

Welcome to Scribd!

  • Assessment 4 CA (With Answer)

    Uploaded by

    NOEL GALLO
    6 views3 pages
    1. The document compares Mealy and Moore machines. It provides an example of a 3 state Mealy machine and a 3 state Moore machine. For each machine, it shows the state transition diagram and how the output is determined. 2. An example of a 3 state Mealy machine is given with its state transition table. It also shows the output for two different input strings. 3. An example of a 3 state Moore machine is given with its state transition table. It also shows the output for two different input strings.

    Original Description:

    Original Title

    Assessment 4 CA(with answer)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document compares Mealy and Moore machines. It provides an example of a 3 state Mealy machine and a 3 state Moore machine. For each machine, it shows the state transition diagram and how the output is determined. 2. An example of a 3 state Mealy machine is given with its state transition table. It also shows the output for two different input strings. 3. An example of a 3 state Moore machine is given with its state transition table. It also shows the output for two different input strings.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views3 pages

    Assessment 4 CA (With Answer)

    Uploaded by

    NOEL GALLO
    1. The document compares Mealy and Moore machines. It provides an example of a 3 state Mealy machine and a 3 state Moore machine. For each machine, it shows the state transition diagram and how the output is determined. 2. An example of a 3 state Mealy machine is given with its state transition table. It also shows the output for two different input strings. 3. An example of a 3 state Moore machine is given with its state transition table. It also shows the output for two different input strings.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    1.

    Mealy Machine

    a ∆ b ∆
    ->q0 q1 y q0 y
    q1 q1 y q2 y
    q2 q1 y q3 x
    q3 q1 y q0 y

    Moore Machine

    Present Next State


    Output
    State a b
    ->q0 q1 q0 y
    q1 q1 q2 y
    q2 q1 q3 y
    q3 q1 q0 x
    2.
    Mealy Machine

    a.
    Q {A, B, C}
    ∑ {0, 1}
    q0 {A}
    ∆ {a, b}

    0 ∆ 1 ∆
    ->A B a C b
    B C b B a
    C B a A a

    b.
    Mealy Machine
    Input String
    Output Path Output String
    01110 ABBBBC aaaab
    10101 ACBBCA baaba
    00110 ABCACB ababa

    c.
    0 ∆ 1 ∆
    ->A B a C b
    B C b B a
    C B a A a

    Present Next State


    Output
    State 0 1
    ->A B C a
    B C B a
    C B A b
    3.

    Moore Machine

    a.
    Q {A, B, C}
    ∑ {0, 1}
    q0 {A}
    ∆ {x, y}

    Present Next State


    Output
    State 0 1
    ->A B A x
    B C A y
    C B C x

    b.
    Moore Machine
    Input String
    Output Path Output String
    01110 ABAAAB xyxxxy
    10101 AABABA xxyxyx
    00110 ABCCCB xyxxxy

    c.
    Present Next State
    Output
    State 0 1
    ->A B A x
    B C A y
    C B C x

    0 ∆ 1 ∆
    ->A B y A x
    B C x A x
    C B y C x

    You might also like