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

Welcome to Scribd!

  • 97 views

    NFA Class 1 PDF

    Uploaded by

    Apoorva Naik
    An NFA can exist in multiple states simultaneously and transitions may be non-deterministic. It is defined by a 5-tuple containing its set of states, input symbols, starting state, accepting states, and transition function that maps state-symbol pairs to sets of states. An NFA can be converted to an equivalent DFA using subset construction and lazy evaluation, which involves constructing a DFA state for each possible subset of NFA states and determining the transitions between these subsets.

    Copyright:

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

    NFA Class 1 PDF

    Uploaded by

    Apoorva Naik
    97 views10 pages
    An NFA can exist in multiple states simultaneously and transitions may be non-deterministic. It is defined by a 5-tuple containing its set of states, input symbols, starting state, accepting states, and transition function that maps state-symbol pairs to sets of states. An NFA can be converted to an equivalent DFA using subset construction and lazy evaluation, which involves constructing a DFA state for each possible subset of NFA states and determining the transitions between these subsets.

    Original Title

    NFA Class 1.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    An NFA can exist in multiple states simultaneously and transitions may be non-deterministic. It is defined by a 5-tuple containing its set of states, input symbols, starting state, accepting states, and transition function that maps state-symbol pairs to sets of states. An NFA can be converted to an equivalent DFA using subset construction and lazy evaluation, which involves constructing a DFA state for each possible subset of NFA states and determining the transitions between these subsets.

    Copyright:

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

    NFA Class 1 PDF

    Uploaded by

    Apoorva Naik
    An NFA can exist in multiple states simultaneously and transitions may be non-deterministic. It is defined by a 5-tuple containing its set of states, input symbols, starting state, accepting states, and transition function that maps state-symbol pairs to sets of states. An NFA can be converted to an equivalent DFA using subset construction and lazy evaluation, which involves constructing a DFA state for each possible subset of NFA states and determining the transitions between these subsets.

    Copyright:

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

    NFA Class 1

    Disadvantages of DFA

    ●
    Constructing a DFA is difficult
    ●
    DFA cannot guess about its input
    ●
    DFA is not very powerful
    ●
    DFA does not have the power to be in
    serveral states at once

    2
    Non-deterministic Finite Automata
    (NFA)
     A Non-deterministic Finite Automaton (NFA)
     is of course “non-deterministic”

    Implying that the machine can exist in more than one
    state at the same time

    Transitions could be non-deterministic

    1 qj
    qi …
     Each transition function therefore
    maps to a set of states
    1
    qk

    3
    Non-deterministic Finite Automata
    (NFA)
     A Non-deterministic Finite Automaton (NFA)
    consists of:
     Q ==> a finite set of states
     ∑ ==> a finite set of input symbols (alphabet)

    q0 ==> a start state
     F ==> set of accepting states
     δ ==> a transition function, which is a mapping between
    Q x ∑ ==> subset of Q
     An NFA is also defined by the 5-tuple:

    {Q, ∑ , q0,F, δ }

    4
    Conversion of NFA to DFA

    1)Subset Construction
    2)Lazy Evaluation
    NFA Transition Table DFA Transition Table

    δ a b δ a b
    -> q0 {q0, q1} q0 ->q0 {q0, q1} q0
    q1 - q2 {q0, q1} {q0, q1} {q0, q2}
    *q2 - - *{q0, q2} {q0, q1} q0

    δ a b
    ->A B A
    B B C
    *C B A
    a b a b
    ->q0 {q0, q1} q0 ->q0 {q0, q1} q0
    q1 - q2 {q0, q1} {q0, q1} {q0, q2}

    *q2 q2 q2 *{q0, q2} {q0, q1, q2} {q0, q2}


    *{q0, q1, q2} {q0, q1, q2} {q0, q2}
    a b
    ->A B A
    B B C
    *C D C
    *D D C

    You might also like