Scribd Logo
Upload

Welcome to Scribd!

  • Lecture 3 - 4

    Uploaded by

    The Caspian
    5 views22 pages
    The document discusses nondeterministic finite automata (NFA) and deterministic finite automata (DFA). It explains that while every NFA can be represented as a DFA, the opposite is not true. NFAs allow multiple possible transitions from a state on a given input, while DFAs only allow one transition. The document provides examples of NFA transition diagrams and notes that NFAs and DFAs are equivalent in terms of the languages they can recognize.

    Original Description:

    Original Title

    Lecture 3_4

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses nondeterministic finite automata (NFA) and deterministic finite automata (DFA). It explains that while every NFA can be represented as a DFA, the opposite is not true. NFAs allow multiple possible transitions from a state on a given input, while DFAs only allow one transition. The document provides examples of NFA transition diagrams and notes that NFAs and DFAs are equivalent in terms of the languages they can recognize.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views22 pages

    Lecture 3 - 4

    Uploaded by

    The Caspian
    The document discusses nondeterministic finite automata (NFA) and deterministic finite automata (DFA). It explains that while every NFA can be represented as a DFA, the opposite is not true. NFAs allow multiple possible transitions from a state on a given input, while DFAs only allow one transition. The document provides examples of NFA transition diagrams and notes that NFAs and DFAs are equivalent in terms of the languages they can recognize.

    Copyright:

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

    CSE322

    DFA and NDFA

    Lecture #3
    Nondeterministic Finite Automaton

    Alphabet =
    {a}

    q1 a q2
    a
    q0
    a
    q3
    Alphabet =
    {a}

    Two choices
    q1 a q2
    a
    q0
    a
    q3
    Alphabet =
    {a}

    Two choices
    q1 a q2 No transition

    a
    q0
    a
    q3 No transition
    NFA and DFA
    Real Life examples
    • example can be any person's career. a person can learn hours and study
    various subjects but will still land on a career less predictable like a
    mathematics student may become a soldier, a botanist may become cook
    etc.
    • Downloading a movie
    CSE322
    Equivalence of DFA and NDFA

    Lecture #3
    Acceptablity
    • NFAs and DFAs are equivalent in that if a
    language is recognized by an NFA, it is also
    recognized by a DFA and vice versa
    DFA and NDFA
    • Every NDFA is DFA but vice versa is not true
    Equivalence of DFA and NDFA
    Equivalence of NFA and DFA
    Problem
    Solution
    Problem
    Solution

    You might also like