Scribd Logo
Upload

Welcome to Scribd!

  • NFA To DFA

    Uploaded by

    SA Gaming
    8 views2 pages
    Subset construction is an algorithm that converts a nondeterministic finite automaton (NFA) without Λ-transitions into a deterministic finite automaton (DFA) by constructing sets of states. A transition table for δ is used to determine the values of δ1 and obtain the DFA.

    Original Description:

    Original Title

    NFA to DFA

    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
    Subset construction is an algorithm that converts a nondeterministic finite automaton (NFA) without Λ-transitions into a deterministic finite automaton (DFA) by constructing sets of states. A transition table for δ is used to determine the values of δ1 and obtain the DFA.

    Copyright:

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

    NFA To DFA

    Uploaded by

    SA Gaming
    Subset construction is an algorithm that converts a nondeterministic finite automaton (NFA) without Λ-transitions into a deterministic finite automaton (DFA) by constructing sets of states. A transition table for δ is used to determine the values of δ1 and obtain the DFA.

    Copyright:

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

    NFA (without Λ-Transitions) to DFA (using Subset Construction):

    It is helpful, and in fact recommended, to use


    a transition table for δ in order to obtain the
    values of δ1.

    You might also like