Scribd Logo
Upload

Welcome to Scribd!

  • HW1

    Uploaded by

    Emmanuel Asamoah
    3 views1 page
    BLG 311E - FORMAL LANGUAGES AND AUTOMATA SPRING 2014 HOMEWORK 1 2. Reduce the states of the Moore machine given below. Then, draw the state transition table of the reduced machine in Mealy model.

    Original Description:

    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
    BLG 311E - FORMAL LANGUAGES AND AUTOMATA SPRING 2014 HOMEWORK 1 2. Reduce the states of the Moore machine given below. Then, draw the state transition table of the reduced machine in Mealy model.

    Copyright:

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

    HW1

    Uploaded by

    Emmanuel Asamoah
    BLG 311E - FORMAL LANGUAGES AND AUTOMATA SPRING 2014 HOMEWORK 1 2. Reduce the states of the Moore machine given below. Then, draw the state transition table of the reduced machine in Mealy model.

    Copyright:

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

    BLG 311E FORMAL LANGUAGES AND AUTOMATA SPRING 2014 HOMEWORK 1

    1. Reduce the states of the incompletely specified Mealy machine below using complete cover and draw the state transition table of the reduced machine in Moore model. 00 a/0 b/0 a/0 d/1 e/0 -/-/01 b/0 -/f/0 -/g/0 f/0 g/0 11 c/0 c/0 c/0 e/0 d/1 -/d/1 10 d/1 -/-/a/0 b/0 a/0 c/0

    a b c d e f g

    2. Reduce the states of the Moore machine given below. Then, draw the state transition table of the reduced machine in Mealy model.

    a b c d e f

    0 a a e a a e

    1 d b c d d c

    Output 0 0 0 0 1 0

    You might also like