Scribd Logo
Upload

Welcome to Scribd!

  • NFA-with Epsilon

    Uploaded by

    Ibrahim Ansari
    23 views4 pages
    The document defines NFA and NFA-ε. An NFA has 5 tuples like DFA but allows transitions on the empty symbol ε. NFA-ε is similar to NFA but the transition function δ specifies transitions from states based on input symbols in Σ or ε. The document provides an example ε-NFA with 4 states that allows ε transitions.

    Original Description:

    Original Title

    NFA-with epsilon

    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 defines NFA and NFA-ε. An NFA has 5 tuples like DFA but allows transitions on the empty symbol ε. NFA-ε is similar to NFA but the transition function δ specifies transitions from states based on input symbols in Σ or ε. The document provides an example ε-NFA with 4 states that allows ε transitions.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    23 views4 pages

    NFA-with Epsilon

    Uploaded by

    Ibrahim Ansari
    The document defines NFA and NFA-ε. An NFA has 5 tuples like DFA but allows transitions on the empty symbol ε. NFA-ε is similar to NFA but the transition function δ specifies transitions from states based on input symbols in Σ or ε. The document provides an example ε-NFA with 4 states that allows ε transitions.

    Copyright:

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

    NFA -ε

    NFA with ε
    • ε → empty symbol
    • NFA has 5-tuples same as DFA but with different transition
    M = (Q,Σ,δ,qo,F)
    Q: finite set called the states
    Σ: finite set called the alphabets
    δ: transition specifying from which state on which input symbol
    where the transition goes (QxΣ)→
    qo: initial state
    F: set of final states

    3
    2
    Definition of NFA
    • NFA has 5-tuples same as DFA but with different
    transition
    M = (Q,Σ,δ,qo,F)
    δ: transition specifying from which state on which input
    symbol where the transition goes QxΣ→

    • NFA-ε has 5-tuples same as DFA but with different


    transition
    M = (Q,Σ,δ,qo,F)
    δ: transition specifying from which state on which input
    symbol where the transition goes Qx(Σ x ε)→

    3
    Example ε-NFA

    3
    4

    You might also like