Scribd Logo
Upload

Welcome to Scribd!

  • Minimization of Dfa - Table Filling Method: (Myhill-Nerode Theorem)

    Uploaded by

    خيرلهداية
    67 views6 pages
    The document describes a table filling method for minimizing a deterministic finite automaton (DFA) based on the Myhill-Nerode theorem. It shows an example table being populated with equivalence classes, with states A, B being distinguished from states C, D, E by the input B, and state F being reachable from all other states. The completed table represents the minimized DFA with two states.

    Original Description:

    DFA

    Original Title

    Automata

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a table filling method for minimizing a deterministic finite automaton (DFA) based on the Myhill-Nerode theorem. It shows an example table being populated with equivalence classes, with states A, B being distinguished from states C, D, E by the input B, and state F being reachable from all other states. The completed table represents the minimized DFA with two states.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    67 views6 pages

    Minimization of Dfa - Table Filling Method: (Myhill-Nerode Theorem)

    Uploaded by

    خيرلهداية
    The document describes a table filling method for minimizing a deterministic finite automaton (DFA) based on the Myhill-Nerode theorem. It shows an example table being populated with equivalence classes, with states A, B being distinguished from states C, D, E by the input B, and state F being reachable from all other states. The completed table represents the minimized DFA with two states.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    of 6

    MINIMIZATION OF DFA – TABLE

    FILLING METHOD

    (MYHILL-NERODE THEOREM)
    MINIMIZATION OF DFA – TABLE FILLING METHOD
    (MYHILL-NERODE THEOREM)
    A B C D E F

    F
    A B C D E F

    F
    A B C D E F

    C √ √

    D √ √

    E √ √

    F √ √ √ √ √
    0 0,1
    0

    AB 1
    CDE 1
    F

    You might also like