Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 65 views

    Nondeterministic Finite Automata: Nondeterminism Subset Construction ε-Transitions

    Uploaded by

    Ismael Sarmento
    A nondeterministic finite automaton (NFA) can be in multiple states simultaneously and transitions from a state on an input symbol can lead to any set of states. An NFA accepts a string if any sequence of choices leads to a final state. While NFAs are easier to design, they are equivalent to deterministic finite automata (DFAs) in the languages they accept. A subset construction algorithm can convert an NFA to an equivalent DFA, potentially exponentially larger. NFAs can also have epsilon transitions, which do not consume input; these are simulated in the equivalent DFA.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Nondeterministic Finite Automata: Nondeterminism Subset Construction ε-Transitions

    Uploaded by

    Ismael Sarmento
    65 views35 pages
    A nondeterministic finite automaton (NFA) can be in multiple states simultaneously and transitions from a state on an input symbol can lead to any set of states. An NFA accepts a string if any sequence of choices leads to a final state. While NFAs are easier to design, they are equivalent to deterministic finite automata (DFAs) in the languages they accept. A subset construction algorithm can convert an NFA to an equivalent DFA, potentially exponentially larger. NFAs can also have epsilon transitions, which do not consume input; these are simulated in the equivalent DFA.

    Original Title

    4_fa3

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    A nondeterministic finite automaton (NFA) can be in multiple states simultaneously and transitions from a state on an input symbol can lead to any set of states. An NFA accepts a string if any sequence of choices leads to a final state. While NFAs are easier to design, they are equivalent to deterministic finite automata (DFAs) in the languages they accept. A subset construction algorithm can convert an NFA to an equivalent DFA, potentially exponentially larger. NFAs can also have epsilon transitions, which do not consume input; these are simulated in the equivalent DFA.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    65 views35 pages

    Nondeterministic Finite Automata: Nondeterminism Subset Construction ε-Transitions

    Uploaded by

    Ismael Sarmento
    A nondeterministic finite automaton (NFA) can be in multiple states simultaneously and transitions from a state on an input symbol can lead to any set of states. An NFA accepts a string if any sequence of choices leads to a final state. While NFAs are easier to design, they are equivalent to deterministic finite automata (DFAs) in the languages they accept. A subset construction algorithm can convert an NFA to an equivalent DFA, potentially exponentially larger. NFAs can also have epsilon transitions, which do not consume input; these are simulated in the equivalent DFA.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 35

    Nondeterministic Finite Automata

    Nondeterminism Subset Construction -Transitions


    1

    Nondeterminism
    A nondeterministic finite automaton has the ability to be in several states at once. Transitions from a state on an input symbol can be to any set of states.

    Nondeterminism (2)
    Start in one start state. Accept if any sequence of choices leads to a final state. Intuitively: the NFA always guesses right.

    Example: Moves on a Chessboard


    States = squares. Inputs = r (move to an adjacent red square) and b (move to an adjacent black square). Start state, final state are in opposite corners.

    Example: Chessboard (2)


    1 4 7 r 1 2 4 2 5 8 b 1 3 5 7 3 6 9 b 5 1 3 7 9 1 2 3 4 5 6 7 8 * 9 r 2,4 4,6 2,6 2,8 2,4,6,8 2,8 4,8 4,6 6,8 b 5 1,3,5 5 1,5,7 1,3,7,9 3,5,9 5 5,7,9 5

    5 Accept, since final state reached

    Formal NFA
    A finite set of states, typically Q. An input alphabet, typically . A transition function, typically . A start state in Q, typically q0. A set of final states F Q.

    Transition Function of an NFA


    (q, a) is a set of states. Extend to strings as follows: Basis: (q, ) = {q} Induction: (q, wa) = the union over all states p in (q, w) of (p, a)

    Language of an NFA
    A string w is accepted by an NFA if (q0, w) contains at least one final state. The language of the NFA is the set of strings it accepts.

    Example: Language of an NFA

    1 4 7

    2 5 8

    3 6 9

    For our chessboard NFA we saw that rbb is accepted. If the input consists of only bs, the set of accessible states alternates between {5} and {1,3,7,9}, so only even-length, nonempty strings of bs are accepted. What about strings with at least one r?
    9

    Equivalence of DFAs, NFAs


    A DFA can be turned into an NFA that accepts the same language. If D(q, a) = p, let the NFA have N(q, a) = {p}. Then the NFA is always in a set containing exactly one state the state the DFA is in after reading the same input.
    10

    Equivalence (2)
    Surprisingly, for any NFA there is a DFA that accepts the same language. Proof is the subset construction. The number of states of the DFA can be exponential in the number of states of the NFA. Thus, NFAs accept exactly the regular languages.
    11

    Subset Construction
    Given an NFA with states Q, inputs , transition function N, state state q0, and final states F, construct equivalent DFA with:
    States 2Q (Set of subsets of Q). Inputs . Start state {q0}. Final states = all those with a member of F.
    12

    Critical Point
    The DFA states have names that are sets of NFA states. But as a DFA state, an expression like {p,q} must be understood to be a single symbol, not as a set. Analogy: a class of objects whose values are sets of objects of another class.
    13

    Subset Construction (2)


    The transition function D is defined by: D({q1,,qk}, a) is the union over all i = 1,,k of N(qi, a). Example: Well construct the DFA equivalent of our chessboard NFA.

    14

    Example: Subset Construction


    1 2 3 4 5 6 7 8 * 9 r 2,4 4,6 2,6 2,8 2,4,6,8 2,8 4,8 4,6 6,8 b 5 1,3,5 5 1,5,7 1,3,7,9 3,5,9 5 5,7,9 5 {1} {2,4} {5} r {2,4} b {5}

    Alert: What were doing here is the lazy form of DFA construction, where we only construct a state 15 if we are forced to.

    Example: Subset Construction


    1 2 3 4 5 6 7 8 * 9 r 2,4 4,6 2,6 2,8 2,4,6,8 2,8 4,8 4,6 6,8 b 5 1,3,5 5 1,5,7 1,3,7,9 3,5,9 5 5,7,9 5 {1} {2,4} {5} {2,4,6,8} {1,3,5,7} r b {2,4} {5} {2,4,6,8} {1,3,5,7}

    16

    Example: Subset Construction


    1 2 3 4 5 6 7 8 * 9 r 2,4 4,6 2,6 2,8 2,4,6,8 2,8 4,8 4,6 6,8 r b b 5 {1} {2,4} {5} 1,3,5 {2,4} {2,4,6,8} {1,3,5,7} 5 {5} {2,4,6,8} {1,3,7,9} 1,5,7 {2,4,6,8} 1,3,7,9 {1,3,5,7} 3,5,9 * {1,3,7,9} 5 5,7,9 5

    17

    Example: Subset Construction


    1 2 3 4 5 6 7 8 * 9 r 2,4 4,6 2,6 2,8 2,4,6,8 2,8 4,8 4,6 6,8 r b b 5 {1} {2,4} {5} 1,3,5 {2,4} {2,4,6,8} {1,3,5,7} 5 {5} {2,4,6,8} {1,3,7,9} 1,5,7 {2,4,6,8} {2,4,6,8} {1,3,5,7,9} 1,3,7,9 {1,3,5,7} 3,5,9 * {1,3,7,9} 5 * {1,3,5,7,9} 5,7,9 5

    18

    Example: Subset Construction


    1 2 3 4 5 6 7 8 * 9 r 2,4 4,6 2,6 2,8 2,4,6,8 2,8 4,8 4,6 6,8 b 5 {1} 1,3,5 {2,4} 5 {5} 1,5,7 {2,4,6,8} 1,3,7,9 {1,3,5,7} 3,5,9 * {1,3,7,9} 5 * {1,3,5,7,9} 5,7,9 5 r {2,4} {2,4,6,8} {2,4,6,8} {2,4,6,8} {2,4,6,8} b {5} {1,3,5,7} {1,3,7,9} {1,3,5,7,9} {1,3,5,7,9}

    19

    Example: Subset Construction


    1 2 3 4 5 6 7 8 * 9 r 2,4 4,6 2,6 2,8 2,4,6,8 2,8 4,8 4,6 6,8 b 5 {1} 1,3,5 {2,4} 5 {5} 1,5,7 {2,4,6,8} 1,3,7,9 {1,3,5,7} 3,5,9 * {1,3,7,9} 5 * {1,3,5,7,9} 5,7,9 5 r {2,4} {2,4,6,8} {2,4,6,8} {2,4,6,8} {2,4,6,8} {2,4,6,8} b {5} {1,3,5,7} {1,3,7,9} {1,3,5,7,9} {1,3,5,7,9} {5}

    20

    Example: Subset Construction


    1 2 3 4 5 6 7 8 * 9 r 2,4 4,6 2,6 2,8 2,4,6,8 2,8 4,8 4,6 6,8 b 5 {1} 1,3,5 {2,4} 5 {5} 1,5,7 {2,4,6,8} 1,3,7,9 {1,3,5,7} 3,5,9 * {1,3,7,9} 5 * {1,3,5,7,9} 5,7,9 5 r {2,4} {2,4,6,8} {2,4,6,8} {2,4,6,8} {2,4,6,8} {2,4,6,8} {2,4,6,8} b {5} {1,3,5,7} {1,3,7,9} {1,3,5,7,9} {1,3,5,7,9} {5} {1,3,5,7,9}

    21

    Proof of Equivalence: Subset Construction


    The proof is almost a pun. Show by induction on |w| that N(q0, w) = D({q0}, w) Basis: w = : N(q0, ) = D({q0}, ) = {q0}.

    22

    Induction
    Assume IH for strings shorter than w. Let w = xa; IH holds for x. Let N(q0, x) = D({q0}, x) = S. Let T = the union over all states p in S of N(p, a). Then N(q0, w) = D({q0}, w) = T.

    23

    NFAs With -Transitions


    We can allow state-to-state transitions on input. These transitions are done spontaneously, without looking at the input string. A convenience at times, but still only regular languages are accepted.
    24

    Example: -NFA

    1 A 0 B 1 C 1 0 F D A B C * D E F 0 1 {E} {B} {C} {D} {D} {F} {B, C} {D}

    25

    Closure of States
    CL(q) = set of states you can reach from state q following only arcs labeled . Example: CL(A) = {A}; CL(E) = {B, C, D, E}.
    1 A 0 B 1 C 1 E D

    Closure of a set of states = union of the closure of each state.


    26

    Extended Delta
    Intuition: (q, w) is the set of states you can reach from q following a path labeled w. Basis: (q, ) = CL(q).
    1. Start with (q, x) = S.

    Induction: (q, xa) is computed by:

    2. Take the union of CL((p, a)) for all p in S.


    27

    Example: Extended Delta


    (A, ) = CL(A) = {A}.

    1 A 0

    B 1 C 1

    (A, 0) = CL({E}) = {B, C, D, E}. (A, 01) = CL({C, D}) = {C, D}. Language of an -NFA is the set of strings w such that (q0, w) contains a final state.
    28

    Equivalence of NFA, -NFA


    Every NFA is an -NFA.
    It just has no transitions on .

    Converse requires us to take an -NFA and construct an NFA that accepts the same language. We do so by combining transitions with the next transition on a real input.
    29

    Picture of -Transition Removal


    To here a Well go from here a

    Transitions on

    a Transitions on
    30

    Equivalence (2)
    Start with an -NFA with states Q, inputs , start state q0, final states F, and transition function E. Construct an ordinary NFA with states Q, inputs , start state q0, final states F, and transition function N.

    31

    Equivalence (3)
    Compute N(q, a) as follows:
    1. Let S = CL(q). 2. N(q, a) is the union over all p in S of E(p, a).

    F = the set of states q such that CL(q) contains a state of F.

    32

    Equivalence (4)
    Prove by induction on |w| that CL(N(q0, w)) = E(q0, w). Thus, the -NFA accepts w if and only if the ordinary NFA does.

    33

    Interesting closures: CL(B) = {B,D}; CL(E) = {B,C,D,E} A B C * D E F 0 1 {E} {B} {C} {D} {D} {F} {B, C} {D}

    Example: -NFAto-NFA
    A * B C * D * E F Doesnt change, 0 1 {E} {B} since B, C, D {C} have no trans {D} itions on 0. {F} {C, D} {D} Since closure of E includes B and C; which have transitions on 1 34 to C and D.

    -NFA

    Since closures of B and E include final state D.

    Summary
    DFAs, NFAs, and NFAs all accept exactly the same set of languages: the regular languages. The NFA types are easier to design and may have exponentially fewer states than a DFA. But only a DFA can be implemented!
    35

    You might also like