Scribd Logo
Upload

Welcome to Scribd!

  • 37 views

    L10-DFA Minimization

    Uploaded by

    Sanket Khaire
    This document summarizes the steps to minimize a deterministic finite automaton (DFA). It begins with an example DFA with 8 states. The steps outlined are: 1) Initialize a table with state pairs marked as unmarked and empty lists, 2) Mark final and non-final state pairs, 3) For each unmarked pair and input symbol, determine the target state, 4) Combine pairs of states that have the same behavior for all inputs, and 5) Delete any unreachable states. The example DFA is then minimized to a 4 state automaton.

    Copyright:

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

    L10-DFA Minimization

    Uploaded by

    Sanket Khaire
    37 views10 pages
    This document summarizes the steps to minimize a deterministic finite automaton (DFA). It begins with an example DFA with 8 states. The steps outlined are: 1) Initialize a table with state pairs marked as unmarked and empty lists, 2) Mark final and non-final state pairs, 3) For each unmarked pair and input symbol, determine the target state, 4) Combine pairs of states that have the same behavior for all inputs, and 5) Delete any unreachable states. The example DFA is then minimized to a 4 state automaton.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document summarizes the steps to minimize a deterministic finite automaton (DFA). It begins with an example DFA with 8 states. The steps outlined are: 1) Initialize a table with state pairs marked as unmarked and empty lists, 2) Mark final and non-final state pairs, 3) For each unmarked pair and input symbol, determine the target state, 4) Combine pairs of states that have the same behavior for all inputs, and 5) Delete any unreachable states. The example DFA is then minimized to a 4 state automaton.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    37 views10 pages

    L10-DFA Minimization

    Uploaded by

    Sanket Khaire
    This document summarizes the steps to minimize a deterministic finite automaton (DFA). It begins with an example DFA with 8 states. The steps outlined are: 1) Initialize a table with state pairs marked as unmarked and empty lists, 2) Mark final and non-final state pairs, 3) For each unmarked pair and input symbol, determine the target state, 4) Combine pairs of states that have the same behavior for all inputs, and 5) Delete any unreachable states. The example DFA is then minimized to a 4 state automaton.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 10

    L9- ToC

    DFA Minimization

    Course Instructors:
    Div 1: Praveen Pawar (Div 1)
    Div 2: Jibi Abraham (Div 2)

    1
    Example-2
     Minimize DFA

    2
    Example-2
    0 1

    0 1 0
    a b c d b
    1 0 1
    0 1
    1 1 0
    e f g h c
    1 0

    0
    d

    e
    1. Initialize table entries:
    Unmarked, empty list f

    a b c d e f g
    3
    Example - 2
    0 1

    0 1 0
    a b c d b
    1 0 1
    0 1
    1 1 0
    e f g h c
    1 0

    0
    d

    e
    2. Mark pairs of final and
    non-final states f

    a b c d e f g
    4
    Example - 2
    d(b,0)  ? d(a,0) = ?
    1
    0 d(b,1)  ? d(a,1) = ?
    0 1 0
    a b c d State (g, b) marked?
    0 1 b
    1 State (c, f) marked?
    0 1
    1 1 0
    e f g h c
    1 0

    0
    d

    e
    3. For each unmarked
    pair and symbol, … f

    a b c d e f g
    5
    Example – 2
    0 1

    0 1 0
    a b c d b
    1 0 1
    0 1
    1 1 0
    e f g h c
    1 0

    0
    d

    e
    4. Combine unmarked
    pairs of states. f
    0 1

    0 1 g
    ae ae bh c
    1 0
    bh 0
    df 1 h
    1 df g
    0 a b c d e f g
    6
    Example - 2
    0 1

    0 1 0
    a b c d
    1 0 1
    0 1
    1 1 0
    e f g h
    1 0

    5. Delete unreachable states: None

    0 1

    0 1
    ae bh c
    1 0
    0
    1
    1 df g
    0
    7
    Example 3
     Minimize DFA

    8
    Example 3
     Solution

    9
    ?
    10

    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