Scribd Logo
Upload

Welcome to Scribd!

  • 87 views

    Automata - Lecture19 - Moore and Mealy Machines

    Uploaded by

    Parsa Shereen
    This lecture discusses Mealy and Moore machines. It defines overflow states that can occur in Mealy machines when the output string is not equal to the input string. The lecture proves that for every Moore machine, there is an equivalent Mealy machine, and vice versa, if the extra output from the Moore machine is ignored. An example is used to demonstrate how to convert a Mealy machine to an equivalent Moore machine by dividing states based on multiple output characters and shifting outputs to new states.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Automata - Lecture19 - Moore and Mealy Machines

    Uploaded by

    Parsa Shereen
    87 views18 pages
    This lecture discusses Mealy and Moore machines. It defines overflow states that can occur in Mealy machines when the output string is not equal to the input string. The lecture proves that for every Moore machine, there is an equivalent Mealy machine, and vice versa, if the extra output from the Moore machine is ignored. An example is used to demonstrate how to convert a Mealy machine to an equivalent Moore machine by dividing states based on multiple output characters and shifting outputs to new states.

    Original Title

    Automata_Lecture19_Moore and Mealy Machines

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This lecture discusses Mealy and Moore machines. It defines overflow states that can occur in Mealy machines when the output string is not equal to the input string. The lecture proves that for every Moore machine, there is an equivalent Mealy machine, and vice versa, if the extra output from the Moore machine is ignored. An example is used to demonstrate how to convert a Mealy machine to an equivalent Moore machine by dividing states based on multiple output characters and shifting outputs to new states.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    87 views18 pages

    Automata - Lecture19 - Moore and Mealy Machines

    Uploaded by

    Parsa Shereen
    This lecture discusses Mealy and Moore machines. It defines overflow states that can occur in Mealy machines when the output string is not equal to the input string. The lecture proves that for every Moore machine, there is an equivalent Mealy machine, and vice versa, if the extra output from the Moore machine is ignored. An example is used to demonstrate how to convert a Mealy machine to an equivalent Moore machine by dividing states based on multiple output characters and shifting outputs to new states.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 18

    THEORY OF AUTOMATA– Lecture

    Lecture Outline
    • Example Moore and Mealy Machines Repeat
    • Incrementing Mealy machines
    • Overflow state
    3
    Constructing the incrementing
    machine continued …
    The Mealy machine have the states
    q0, q1, q2 , where q0 is the start state and
     = {0,1},
    Г={0,1}
    4

    Overflow state
    Due to typical property of Mealy machines of
    having input bits equals to outputs, if string 1111 is
    run as input, the output will be 0000 and not
    10000. This is called overflow state.
    5

    Relationship between input and output


    • Generally, a Mealy machine does not accept or
    reject an input string, there is an implicit
    relationship between the input and output
    string.
    • Consider the following example Mealy machine
    taken from Daniel A Cohen book, in which
    whenever a double letter such as aa or bb
    appears, the output string places 1 as indication.
    6
    7

    Theorem

    Statement:
    For every Moore machine there is a Mealy
    machine that is equivalent to it (ignoring
    the extra character printed the Moore
    machine).
    Proof: see the following example…
    8
    9

    Theorem
    Statement:
    For every Mealy machine there is a Moore
    machine that is equivalent to it (ignoring
    the extra character printed the Moore
    machine).
    Proof: Let M be a Mealy machine. At
    each state there are two possibilities for
    incoming transitions
    1. All incoming transitions have the same
    output.
    2. All incoming transitions have different
    output.
    10

    Proof continued …

    • If all the transitions have same output


    characters, handling it is very easy.
    • If all the transitions have different output
    characters, then the corresponding state
    will be divided in to the number of outputs
    generated by incoming transitions.
    • Please note that the divided state shall
    behave like the undivided one, that is the
    output should be same.
    11

    Continued…
    • Initial state conversion….
    • No output on a set of transitions….
    12

    Example
    Consider the following Mealy machine
    13

    Example continued ...


    Dividing the state q0 into q0/0 and q0/1
    14

    Example continued ...


    Shifting the output character 1 of transition a to q1
    15

    Example continued ...


    Shifting the output character 0 of transition b to q3
    16
    Example continued ...
    Dividing the state q2 into q2/0 and q2/1
    17

    Summary

    • Equivalence of Mealy and Moore Machines –


    Repeat
    • Transducers (NAND,OR,AND,NOT)
    • Transducers Example 1
    • Transducers Example 2
    Reference
    • Theory of computation by Daniel. I
    .Cohen
    • Lecture slides compilation resource [Theory Of
    Automata by Dr. M M Alam]

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy